gives the list of edge rules for the graph g.
uses rules vw to specify the graph g.
- EdgeRules[g] returns the list of edge rules in the order used by the graph g.
- Undirected edges uv and directed edges uv are both represented as the rule u->v.
Examplesopen allclose all
Basic Examples (2)
Properties & Relations (8)
EdgeRules gives rules for undirected graphs:
Reconstruct the undirected graph:
EdgeRules gives rules for directed graphs:
Reconstruct the directed graph:
Rules cannot represent isolated vertices:
Reconstructing the graph from EdgeRules excludes isolated vertices:
Including the vertex list reconstructs the full graph:
EdgeRules can be found using EdgeList:
EdgeCount can be found using EdgeRules:
Rules are given in the same order they are entered for Graph:
Edge rules can be explicitly specified in Graph:
Use EdgeRules to extract the AnnotationValue of edges:
Wolfram Research (2010), EdgeRules, Wolfram Language function, https://reference.wolfram.com/language/ref/EdgeRules.html (updated 2015).
Wolfram Language. 2010. "EdgeRules." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/EdgeRules.html.
Wolfram Language. (2010). EdgeRules. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/EdgeRules.html