This is documentation for Mathematica 8, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.1)

EdgeRules

EdgeRules[g]
gives the list of edge rules for the graph g.
  • EdgeRules[g] returns the list of edge rules in the order used by the graph g.
  • Undirected edges and directed edges are both represented as the rule .
The list of edge rules for an explicitly constructed graph:
For a parametrically constructed graph:
The list of edge rules for an explicitly constructed graph:
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
 
For a parametrically constructed graph:
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
EdgeRules works with undirected graphs:
Directed graphs:
Works with large graphs:
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 PropertyValue of edges:
New in 8