Directed graph: Difference between revisions
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
=Definition= | =Definition= | ||
A directed graph is a [[graph]] that is made up of a set of vertices connected by directed | A directed graph is a [[graph]] that is made up of a set of [[vertex|vertices]] connected by directed [[edge]]s. | ||
<ref>Wikipedia: Directed graph. [https://en.wikipedia.org/wiki/Directed_graph]</ref> | <ref>Wikipedia: Directed graph. [https://en.wikipedia.org/wiki/Directed_graph]</ref> | ||
Revision as of 22:10, 18 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: