undirected graph

التعريفات والمعاني

== English == === 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 ==== === Further reading === Graph (discrete mathematics) § Graph on Wikipedia.Wikipedia