Undirected Graphs¶
The following graph manipulation routines use the red-black tree graph library to implement undirected graphs.
Mostly, this is done by having two directed edges per undirected edge.
- undgraph_del_vertices/4
- undgraph_del_edges/4
- undgraph_neighbours/4
- undgraph_edges/3
- undgraph_add_vertices/4
- undgraph_add_edges/4
- undgraph_vertices/3
- undgraph_complement/3
- undgraph_new/1
- prolog::undgraph_components/2
- prolog::undgraph_min_tree/2
- prolog::undgraph_del_vertices/3
- prolog::undgraph_del_vertex/3
- prolog::undgraph_del_edges/3
- prolog::undgraph_del_edge/4
- prolog::undgraph_neighbors/3
- prolog::undgraph_neighbours/3
- prolog::undgraph_edges/2
- prolog::undgraph_add_vertices/3
- prolog::undgraph_add_edges/3
- prolog::undgraph_add_edge/4