noun
undirected graph
Technical term in graph theory; edges have no direction. Contrasts with 有向グラフ (directed graph).
See also: 有向グラフ
無向グラフでは、辺に向きがない。
In an undirected graph, edges have no direction.
この問題は無向グラフの最短経路を求めるものだ。
This problem is about finding the shortest path in an undirected graph.