Directed graph

From Knowledge Management
Jump to navigation Jump to search

Definition

A directed graph is a graph that is made up of a set of vertices connected by directed edges. [1]

Synonyms

  • Digraph

Generic relations

In Generic relations. superordinate concepts and subordinate concepts can be distinguished:

Superordinate concept is:

Subordinate concepts are:

References

  1. ↑ Wikipedia: Directed graph. [1]
Retrieved from "http://knowledgemanagement.wiki/index.php?title=Directed_graph&oldid=1046"