undirected graph

English

Noun

undirected graph (plural undirected graphs)

(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

Japanese: 無向グラフ (mukō gurafu)
Portuguese: grafo não-orientado m

This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.