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