Declared in <graph/Stable_adjacency_list.hpp>:
class Stable_bi_adjacency_list;Satisfies the Bi_edge_graph concept using a classical adjacency list data structure.
In addition to the members required by the Bi_edge_graph concept, Stable_bi_adjacency_list provides functions to facilitate mutation.
| Member functions | ||
|---|---|---|
insert_vert() |
Vert |
constructs a new vertex |
insert_edge(Vert s, Vert t) |
Edge |
constructs a new edge with tail s and head t |