Directed graph: Difference between revisions
Jump to navigation
Jump to search
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 | <ref>Wikipedia. [https://en.wikipedia.org/wiki/Directed_graphDirected graph.]</ref> | ||
= | =[[Synonym]]s= | ||
* Digraph | * Digraph | ||
=Generic | =[[Generic relation]]s= | ||
In [[Generic relation]]s. [[superordinate concept]]s and [[subordinate concept]]s can be distinguished: | In [[Generic relation]]s. [[superordinate concept]]s and [[subordinate concept]]s can be distinguished: | ||
| Line 15: | Line 15: | ||
* [[Knowledge graph]] | * [[Knowledge graph]] | ||
= | =[[Reference]]s= | ||
[[Category:All]] | [[Category:All]] | ||
Revision as of 15:31, 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: