Directed graph: Difference between revisions
Jump to navigation
Jump to search
(Created page with "In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often called arcs. https://en.wikipedia.org/wiki/Directed_graph =Definition= A directed graph is a graph that is made up of a set of vertices connected by directed edges. =Synonyms= * Digraph =Generic relations= In Generic relations. superordinate concepts and subordinate concepts can be dist...") |
|||
| (6 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
=[[Definition]]= | |||
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> | |||
=[[Synonym]]s= | |||
= | |||
* Digraph | * Digraph | ||
= | =[[Generic relation]]s= | ||
[[Superordinate concept]] is: | [[Superordinate concept]] is: | ||
| Line 18: | Line 14: | ||
* [[Knowledge graph]] | * [[Knowledge graph]] | ||
= | =[[Reference]]s= | ||
[[Category:All]] | [[Category:All]] | ||
Latest 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
Subordinate concepts are:
References
- ↑ Wikipedia. Directed graph.