edges -- Returns the edges of a digraph or graph

Synopsis

Usage:

E = edges D

E = edges G
Inputs:
- D, an instance of the type Digraph,
- G, an instance of the type Graph,
Outputs:
- E, a list, The edges of digraph D or graph G

Description

The edges of a graph are pairs (or ordered pairs if we are dealing with digraphs) of vertices that are connected in a graph. Any edge must be a member of the collection of subsets of the vertex set of a graph.

i1 : D = digraph({{1,2},{2,1},{3,1}},EntryMode=>"edges");

i2 : edges D

o2 = {{1, 2}, {2, 1}, {3, 1}}

o2 : List

i3 : G = cycleGraph 4;

i4 : edges G

o4 = {set {0, 1}, set {0, 3}, set {1, 2}, set {2, 3}}

o4 : List

Ways to use `edges` :

"edges(Digraph)"
"edges(Graph)"

For the programmer

The object edges is a method function.

edges -- Returns the edges of a digraph or graph

Synopsis

Description

See also

Ways to use edges :

For the programmer

Ways to use `edges` :