Directed graph: Difference between revisions

From Knowledge Management
Jump to navigation Jump to search
No edit summary
 
(One intermediate revision 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 [[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/Directed_graphDirected graph.]</ref>
<ref>Wikipedia. [https://en.wikipedia.org/wiki/Directed_graph Directed graph.]</ref>


=[[Synonym]]s=
=[[Synonym]]s=
Line 7: Line 7:


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


[[Superordinate concept]] is:
[[Superordinate concept]] is:

Latest revision as of 15:32, 30 December 2022