Directed graph
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.
<ref.>Wikipedia: Directed graph. [1]</ref>
Synonyms
- Digraph
Generic relations
In Generic relations. superordinate concepts and subordinate concepts can be distinguished:
Subordinate concepts are: