VertexOutDegree

The number of edges of a Graph leaving a vertex.

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

VertexOutDegree(g)every vertex's out-degree, in VertexList(g) order.

VertexOutDegree(g, v)just v's out-degree.

Typed signatures

Type	Package	Applies
(value, any?) -> integer | list<integer>	combinatorics	always

Domain: Collections

Details

• See VertexInDegree for how undirected edges are handled -- the two heads are symmetric.

Examples

Basic #

live ↗

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

live ↗

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

Applications #

live ↗

In$\mathrm{Union}(\mathrm{VertexOutDegree}(g))$Out$\mathrm{VertexOutDegree}(g)$

About

Examples	3
Checked against	Wolfram Language 3 agree
Crosswalk	Wolfram Language

See also: VertexInDegree, VertexDegree