EdgeList

The edges of a Graph, as declared, in order.

✓ checked against that system · ! checked, with disagreements (hover a chip)Wolfram LanguageEdgeList✓↗

EdgeList(g)every edge of $g$ (UndirectedEdge/DirectedEdge), in declaration order.

Typed signatures

Type	Package	Applies
(value) -> list<value>	combinatorics	always

Domain: Collections

Examples

Basic #

Edges of a mixed undirected/directed graph

live ↗

In$\mathrm{EdgeList}(\mathrm{Graph}(\bigl\lbrack\mathrm{UndirectedEdge}(2, 1), \mathrm{DirectedEdge}(1, 3)\bigr\rbrack))$Out$\bigl\lbrack\mathrm{UndirectedEdge}(2, 1), \mathrm{DirectedEdge}(1, 3)\bigr\rbrack$

Properties #

A single-edge graph has exactly one entry in its edge list

live ↗

In$\mathrm{Length}(\mathrm{EdgeList}(g))$Out$1$

About

Examples	2
Checked against	Wolfram Language 2 agree
Crosswalk	Wolfram Language

See also: Graph, VertexList, EdgeCount