undirected graph

English

Noun

undirected graph (plural undirected graphs)

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

Synonyms

Antonyms

Translations

This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.