Enable JavaScript to interact with content and submit forms on Wolfram websites. Learn how

Wolfram Language & System Documentation Center

EdgeWeightedGraphQ

EdgeWeightedGraphQ[g]

yields True if the graph g is an edge-weighted graph and False otherwise.

Details

EdgeWeightedGraphQ will give True if there is an explicit EdgeWeight property defined.

Examples

open all close all

Basic Examples (2)

Test whether a graph is an edge-weighted graph:

Wolfram Language code: EdgeWeightedGraphQ[CompleteGraph[5, EdgeWeight -> Range[10]]]

Test matrix graphs:

Wolfram Language code:

EdgeWeightedGraphQ[AdjacencyGraph[(|   |   |   |
| - | - | - |
| 0 | 1 | 0 |
| 0 | 0 | 1 |
| 1 | 0 | 0 |)]]

Scope (7)

EdgeWeightedGraphQ works with undirected graphs:

Wolfram Language code: EdgeWeightedGraphQ[[image]]

Directed graphs:

Wolfram Language code: EdgeWeightedGraphQ[[image]]

Weighted graphs:

Wolfram Language code: EdgeWeightedGraphQ[[image]]

Multigraphs:

Wolfram Language code: EdgeWeightedGraphQ[[image]]

Mixed graphs:

Wolfram Language code: EdgeWeightedGraphQ[[image]]

EdgeWeightedGraphQ gives False for anything that is not a vertex-weighted graph:

Wolfram Language code: EdgeWeightedGraphQ[x]

Wolfram Language code: EdgeWeightedGraphQ[Graph[garbage]]

EdgeWeightedGraphQ works with large graphs:

Wolfram Language code: GridGraph[{10, 10, 10, 10}, EdgeWeight -> RandomReal[{0, 1}, 36000]];

Wolfram Language code: EdgeWeightedGraphQ[%] // Timing

Properties & Relations (2)

The edge-weighted graph is always a weighted graph:

Wolfram Language code: g = GridGraph[{3, 4}, EdgeWeight -> RandomReal[{0, 1}, 17]]

Wolfram Language code: EdgeWeightedGraphQ[g]

Wolfram Language code: WeightedGraphQ[g]

The weighted graph is not always an edge-weighted graph:

Wolfram Language code: g = GridGraph[{3, 4}, VertexWeight -> RandomReal[{0, 1}, 12]]

Wolfram Language code: WeightedGraphQ[g]

Wolfram Language code: EdgeWeightedGraphQ[g]

Possible Issues (1)

EdgeWeightedGraphQ gives False for non-explicit graphs:

Wolfram Language code: EdgeWeightedGraphQ[CompleteGraph[n]]

Top