Digraphs: Difference between revisions
Jump to navigation
Jump to search
(Created page with "A '''digraph''' is a directed graph; a graph in which the edges have a direction. This is usually indicated with an arrow on the edge. The formal definition is: If v and w...") |
(No difference)
|
Revision as of 10:34, 9 January 2022
A digraph is a directed graph; a graph in which the edges have a direction.
This is usually indicated with an arrow on the edge.
The formal definition is: If v and w are vertices, an edge is an unordered pair {v,w}, while a directed edge, called an arc, is an ordered pair (v,w) or (w,v).