Ordered Pairs Representation

An ordered pair representation is a representation of a directed graph in which edges are specified as ordered pairs or vertex indices. The ordered pairs representation of a directed graph g may be computed in the Wolfram Language using List @@@ EdgeList[g], and a graph may be constructed from an ordered pair representation l using Graph[DirectedEdge @@@ l].

See also

Directed Graph, Unordered Pairs Representation

Explore with Wolfram|Alpha


Skiena, S. "Ordered Pairs." §3.1.3 in Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, pp. 87-88, 1990.

Referenced on Wolfram|Alpha

Ordered Pairs Representation

Cite this as:

Weisstein, Eric W. "Ordered Pairs Representation." From MathWorld--A Wolfram Web Resource.

Subject classifications