Directed graph: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
=[[Definition]]= | =[[Definition]]= | ||
A directed graph is a [[graph]] that is made up of a set of [[vertex|vertices]] connected by directed [[edge]]s. | A directed graph is a [[graph]] that is made up of a set of [[vertex|vertices]] connected by directed [[edge]]s. | ||
<ref>Wikipedia. [https://en.wikipedia.org/wiki/ | <ref>Wikipedia. [https://en.wikipedia.org/wiki/Directed_graph Directed graph.]</ref> | ||
=[[Synonym]]s= | =[[Synonym]]s= | ||
Revision as of 15:32, 30 December 2022
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:
Subordinate concepts are:
References
- ↑ Wikipedia. Directed graph.