undirected graph

English

Noun

undirected graph (plural undirected graphs)

1. (graph theory) A graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a).

Synonyms

• graph

Antonyms

• directed graph

Translations

type of graph

• Czech: neorientovaný graf m
• Danish: ikke-orienteret graf c
• Finnish: suuntaamaton verkko
• (deprecated template usage) {{trans-mid}}
• Japanese: 無向グラフ (mukō gurafu)
• Portuguese: grafo não-orientado m