concept In_edge_graph : Graph;
Extends the Graph concept with fast incoming edge queries.
In this library, every data structure that satisfies this concept will be an instance of In_edge_graph<...>, so to require that a function argument satisfies it, you need only use a signature like the following:
template <class G>
void some_function(const In_edge_graph<G>& g);
| Member type |
Definition |
In_degree |
Unsigned integer type |
| Member functions |
|
|
in_edges(Vert t) const |
Range<Edge> |
returns all edges with head t |
in_degree(Vert t) const |
In_degree |
returns size(in_edges(t)) |
| Algorithms |
|
|
shortest_paths_to<W>(Vert t, Map<Edge, W> w) |
pair<Out_subtree, Map<Vert, W>>> |
finds the paths to t with minimum total edge weights w from all vertices |
minimum_tree_reaching_to<W>(Vert s, Map<Edge, W> w) |
Out_subtree |
finds the tree with minimum total edge weights w that spans vertices from which v is reachable |