English
A simple undirected graph.
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: grafo non orientato, grafo non diretto
- Japanese: 無向グラフ (むこうぐらふ, mukōgurafu)
- Korean: 무향 그래프 (muhyang geuraepeu)
- Norwegian: urettet graf (no) m
- Polish: graf nieskierowany m inan
- Portuguese: grafo não orientado m
- Russian: please add this translation if you can
- Spanish: grafo no dirigido m
- Swedish: oriktad graf c
- Tagalog: please add this translation if you can
|
Further reading
Hidden categories:
- Pages with entries
- Pages with 1 entry
- Entries with translation boxes
- Mandarin terms with redundant transliterations
- Terms with Mandarin translations
- Terms with Czech translations
- Terms with Danish translations
- Terms with Dutch translations
- Terms with Finnish translations
- Terms with French translations
- Terms with German translations
- Terms with Hungarian translations
- Terms with Italian translations
- Terms with Japanese translations
- Terms with Korean translations
- Terms with Norwegian translations
- Terms with Polish translations
- Terms with Portuguese translations
- Requests for translations into Russian
- Terms with Spanish translations
- Terms with Swedish translations
- Requests for translations into Tagalog