EdgeRules

EdgeRules[g]

gives the list of edge rules for the graph g.

EdgeRules[{vw,}]

uses rules vw to specify the graph g.

Details

  • 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.

Examples

open allclose all

Basic Examples  (2)

The list of edge rules for an explicitly constructed graph:

For a parametrically constructed graph:

Scope  (4)

EdgeRules works with undirected graphs:

Directed graphs:

Use rules to specify the graph:

EdgeRules works with large graphs:

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:

TreeGraph:

PathGraph:

Use EdgeRules to extract the AnnotationValue of edges:

Introduced in 2010
 (8.0)
 |
Updated in 2015
 (10.3)