EdgeRules

EdgeRules(graph)

convert the graph into a list of rules. All edge types (undirected, directed) are represented by a rule lhs->rhs.

See:

• Wikipedia - Graph theory

Examples

>> EdgeRules(Graph({1 \\[UndirectedEdge] 2, 2 \\[UndirectedEdge] 3, 3 \\[UndirectedEdge] 1}))
{1->2,2->3,3->1}

Related terms

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

Implementation status

• ✅ - full supported

Github

• Implementation of EdgeRules