最終更新日：2024/07/28

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

正解を見る

undirected graph

問題を編集する

元となった辞書の項目

undirected graph

noun

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

An undirected graph is a graph in which edges have no direction.

意味（1）

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