bn:01240512n
Noun Concept
Categories: Graph theory, Directed graphs, Graph data structures
EN
directed graph  directed edge  arc  Balanced digraph  digraph
EN
In mathematics, and more specifically in graph theory, a directed graph is a graph that is made up of a set of vertices connected by directed edges, often called arcs. Wikipedia
Definitions
Examples
Relations
Sources
EN
In mathematics, and more specifically in graph theory, a directed graph is a graph that is made up of a set of vertices connected by directed edges, often called arcs. Wikipedia
Graph with oriented edges Wikidata
A graph in which the edges are ordered pairs, so that, if the edge (a, b) is in the graph, the edge (b, a) need not be in the graph and is distinct from (a, b) if it is. Wiktionary
Type of graphs. Wiktionary (translation)
EN
A directed graph (A, R) is a set of vertices A together with an incidence relation R: if aRb then there is an edge going from A to B. Wiktionary
IS A
HAS KIND
DIFFERENT FROM
HAS PARTS OF THE CLASS
OPPOSITE OF
STUDIED BY
Wikipedia
Wikidata
Wiktionary
Wikipedia Redirections
EN
Wikidata Alias
EN