Skip to content
Francois Vanderseypen edited this page Feb 12, 2015 · 1 revision

A graph data structure consists of a finite (and possibly mutable) set of nodes or vertices, together with a set of ordered pairs of these nodes (or, in some cases, a set of unordered pairs). These pairs are known as edges or arcs.

Clone this wiki locally