|
GraphTheory[Degree]
GraphTheory[InDegree]
GraphTheory[OutDegree]
|
|
Calling Sequence
|
|
Degree(G, v)
InDegree(H, v)
OutDegree(H, v)
|
|
|
Parameters
|
|
|
G
|
-
|
directed or undirected graph
|
|
H
|
-
|
directed graph
|
|
v
|
-
|
vertex
|
|
|
|
|
|
Description
|
|
|
•
|
Degree returns the number of edges of the graph G which are incident to v. The directions of the edges are ignored.
|
|
•
|
InDegree returns the number of arcs directed into v.
|
|
•
|
OutDegree returns the number of arcs directed out of v.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
>
|
|
|
| (2) |
|
>
|
|
|
| (3) |
|
>
|
|
|
| (4) |
|
|
Download Help Document
Was this information helpful?
