Directed graph

In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph, or set of nodes connected by edges, where the edges have a direction associated with them. In formal terms, a digraph is a pair (sometimes ) of:[1]

 cycle graph theory

Related links

  • PHP implementation of Tarjan's cycle detection algorithm
  • Return to the linkmark list.