Directed-graph Definition

noun

(graph theory) 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.

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

Other Word Forms of Directed-graph

Noun

Singular:
directed-graph
Plural:
directed-graphs

Related Articles

Find Similar Words

Find similar words to directed-graph using the buttons below.

Words Starting With

DDIDIR

Words Ending With

HPHAPH

Unscrambles

directed-graph

Words Starting With D and Ending With H

Starts With D & Ends With HStarts With DI & Ends With HStarts With D & Ends With PH

Word Length

14 Letter Words14 Letter Words Starting With D14 Letter Words Ending With H