WeightedGraphQ

WeightedGraphQ(expr)

test if expr is an explicit weighted graph object.

See:

• Wikipedia - Graph
• Wikipedia - Graph theory
• Wikipedia - Calculus on finite weighted graphs

Examples

>> WeightedGraphQ(Graph({1 -> 2, 2 -> 3, 1 -> 3, 4 -> 2}) )
True

>> WeightedGraphQ( Sin(x) )
False

>> WeightedGraphQ( Graph({1->2, 2->3, 3->1}, EdgeWeight->{5.061,2.282,5.086}) )
True

Related terms

GraphCenter, GraphDiameter, GraphPeriphery, GraphRadius, AdjacencyMatrix, EdgeList EdgeQ, EulerianGraphQ, FindEulerianCycle, FindHamiltonianCycle, FindVertexCover, FindShortestPath, FindSpanningTree, Graph, GraphQ, HamiltonianGraphQ, VertexEccentricity, VertexList, VertexQ

Implementation status

• ✅ - full supported

Github

• Implementation of WeightedGraphQ