Concept information
Preferred term
directed graph
Definition
-
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.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Directed_graph)
Broader concept
Narrower concepts
Synonym(s)
- digraph
In other languages
-
French
URI
http://data.loterre.fr/ark:/67375/PSR-FB80M997-T
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}