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...") |
No edit summary |
||
| 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 vertices connected by directed edges. | ||
https://en.wikipedia.org/wiki/Directed_graph<ref>Wikipedia: Directed graph. </ref> | |||
=Synonyms= | =Synonyms= | ||
Revision as of 22:08, 18 December 2022
Definition
A directed graph is a graph that is made up of a set of vertices connected by directed edges.
https://en.wikipedia.org/wiki/Directed_graph[1]
Synonyms
- Digraph
Generic relations
In Generic relations. superordinate concepts and subordinate concepts can be distinguished:
Subordinate concepts are:
References
- ↑ Wikipedia: Directed graph.