Directed Graphs¶
The following graph manipulation routines use the red-black tree library to try to avoid linear-time scans of the graph for all graph operations.
Graphs are represented as a red-black tree, where the key is the vertex, and the associated value is a list of vertices reachable from that vertex through an edge (ie, a list of edges).
- dgraph_leaves/3
- dgraph_isomorphic/5
- dgraph_edge/4
- dgraph_to_ugraph/3
- dgraph_top_sort/4
- dgraph_symmetric_closure/3
- dgraph_transitive_closure/3
- dgraph_transpose/3
- dgraph_del_vertices/4
- dgraph_del_vertex/4
- dgraph_del_edges/4
- dgraph_complement/3
- dgraph_neighbors/4
- dgraph_neighbours/4
- dgraph_vertices/3
- dgraph_edges/3
- dgraph_add_vertex/4
- dgraph_add_vertices/4
- dgraph_add_edges/4
- dgraph_new/1
- prolog::dgraph_leaves/2
- prolog::dgraph_reachable/3
- prolog::dgraph_isomorphic/4
- prolog::dgraph_path/3
- prolog::dgraph_path/4
- prolog::dgraph_edge/3
- prolog::dgraph_to_ugraph/2
- prolog::ugraph_to_dgraph/2
- prolog::dgraph_top_sort/3
- prolog::dgraph_top_sort/2
- prolog::dgraph_symmetric_closure/2
- prolog::dgraph_transitive_closure/2
- prolog::dgraph_compose/3
- prolog::dgraph_transpose/2
- prolog::dgraph_del_vertices/3
- prolog::dgraph_del_vertex/3
- prolog::dgraph_del_edges/3
- prolog::dgraph_del_edge/4
- prolog::dgraph_complement/2
- prolog::dgraph_neighbors/3
- prolog::dgraph_neighbours/3
- prolog::dgraph_vertices/2
- prolog::dgraph_edges/2
- prolog::dgraph_add_vertex/3
- prolog::dgraph_add_vertices/3
- prolog::dgraph_add_edges/3
- prolog::dgraph_add_edge/4