GlossaryΒΆ

loop
An edge from a node to itself. Counts as both an ingoing and outgoing edge for outdegree, indegree and degree.
indegree

The number of ingoing edges of a node. If a node has a loop, it also counts as an ingoing edge.

The number of nodes to which a node is a neighbour.

outdegree

The number of outgoing edges of a node. If a node has a loop, it also counts as an outgoing edge.

The number of neighbours of a node.

degree

The number of ingoing and outgoing edges of a node. If a node has a loop, it counts as both an ingoing and outgoing edge.

The degree of a node is the sum of its indegree and outdegree.

graph
A collection of nodes, edges between them and possibly values associated with any edges.
node
A regular object in a graph.
edge
arrow
A connection between two nodes in a graph.
edge value
weight
The value associated with an edge in a graph.
neighbour

A node with an edge from a specific node. Given an edge a:b, b is a neighbour of a.

The number of neighbours is the outdegree.