undirected graph

undirected graph antonyms

directed graph compare undirected graph and directed graph

undirected graph definitions

noun

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