Undirected Graph
(Redirected from undirected graph)
Jump to navigation
Jump to search
A directed graph is a graph whose graph edges are all undirected graph edges.
- Context:
- It can range from being a Connected Undirected Graph to being a Disconnected Undirected Graph.
- Example(s):
- a Spanning Tree.
- …
- Counter-Example(s):
- See: Undirected Weighted Graph.