Directed graph: Difference between revisions

From Knowledge Management
Jump to navigation Jump to search
No edit summary
 
(4 intermediate revisions by the same user not shown)
Line 1: Line 1:
=Definition=
=[[Definition]]=
A directed graph is a [[graph]] that is made up of a set of vertices connected by directed edges.
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/Directed_graph Directed graph.]</ref>


<ref.>Wikipedia: Directed graph. [https://en.wikipedia.org/wiki/Directed_graph]</ref>
=[[Synonym]]s=
 
=Synonyms=
* Digraph
* Digraph


=Generic relations=
=[[Generic relation]]s=
In [[Generic relation]]s. [[superordinate concept]]s and [[subordinate concept]]s can be distinguished:


[[Superordinate concept]] is:
[[Superordinate concept]] is:
Line 16: Line 14:
* [[Knowledge graph]]
* [[Knowledge graph]]


=References=
=[[Reference]]s=


[[Category:All]]
[[Category:All]]

Latest revision as of 15:32, 30 December 2022