Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01240512n
Noun Concept
Categories: Graph theory, Graph data structures, Directed graphs
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
graph
HAS KIND
nearest neighbor graph
tournament
signal-flow graph
skew-symmetric graph
Coates graph
+14 relations
DIFFERENT FROM
digraph
HAS PARTS OF THE CLASS
vertex
OPPOSITE OF
undirected graph
STUDIED BY
graph theory
Wikipedia
EN
directed graph
Wikidata
EN
directed graph
Wiktionary
EN
directed graph
Wikipedia Redirections
EN
arc (graph theory), Balanced digraph, digraph (mathematics), directed cyclic graph, directed edge, Directed Graph, Graph arc, in-degree, indegree, information sink, Oriented Graph, out-degree, outdegree, simple directed graph, sink (graph theory), source (graph theory), Strongly-connected digraph, underlying graph, weighted digraph
Wikidata Alias
EN
digraph

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License