Definitions | undirected graph |
| noun (plural undirected graphs)
- (graphtheory) A graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a).
Translations: Supplemental Details:Sponsor an extended definition for undirected graph for as little as $10 per month. Click here to contact us.
| |
|