directed graphs
directed graphs is the plural of directed graph.
Meaning of directed graph
Noun
directed graph (plural directed graphs)
- 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.
- Synonyms:
- digraph
- Antonyms:
- undirected graph
Questions about directed graphs
- What is directed graphs the plural of?
- Directed graphs is the plural of directed graph.
Words near directed graphs in the dictionary
Source and license
Adapted from Wiktionary: directed graphs (page history and authors); directed graph (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “directed graphs.” Word.ws, https://word.ws/directed_graphs. Based on Wiktionary, CC BY-SA 4.0.
