directed or undirected graph
Degree returns the degree of v; that is, the number of edges of the graph G which are incident to v. The directions of the edges are ignored.
InDegree returns the in-degree of v; that is, the number of arcs directed into v.
OutDegree returns the out-degree of v; that is, the number of arcs directed out of v.
G ≔ Digraph⁡Trail⁡1,2,3,4,2
G≔Graph 1: a directed unweighted graph with 4 vertices and 4 arc(s)
Download Help Document
What kind of issue would you like to report? (Optional)