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).
- Synonym: graph
- Antonym: directed graph
Translations
type of graph
- Chinese:
- Mandarin: 無向圖 / 无向图 (wúxiàngtú)
- Czech: neorientovaný graf m
- Danish: ikke-orienteret graf c
- Dutch: ongerichte graaf m
- Finnish: suuntaamaton verkko
- French: graphe non orienté (fr) m
- German: gerichteter Graph m, Digraph (de) m
- Hungarian: irányítatlan gráf (hu)
- Italian: please add this translation if you can
- Japanese: 無向グラフ (むこうぐらふ, mukōgurafu)
- Korean: 무향 그래프 (muhyang geuraepeu)
- Norwegian: urettet graf (no) m
- Polish: graf nieskierowany m
- Portuguese: grafo não-orientado m
- Russian: please add this translation if you can
- Spanish: please add this translation if you can
- Swedish: please add this translation if you can
- Tagalog: please add this translation if you can
|
Further reading