|
lean_graph
|
|
|
lean_graph
|
|
This is the complete list of members for lean_graph::DiGraph< NodeType, Cost, CounterType, H >, including all inherited members.
| bellman_ford(CounterType start) const -> std::pair< std::unordered_map< CounterType, Cost >, std::unordered_map< CounterType, CounterType > > const | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | inline |
| bfs() const -> std::vector< CounterType > | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | inline |
| cycles() const -> std::vector< std::vector< CounterType > > | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | inlinevirtual |
| dfs() const -> std::vector< CounterType > | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | inline |
| EdgeIte class | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | friend |
| edges() const -> std::vector< CounterEdge< CounterType, Cost > > | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | inlinevirtual |
| existBlankEdge(CounterBlankEdge< CounterType > edge) const -> bool | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | inline |
| existBlankEdge(CounterEdge< CounterType, Cost > edge) const -> bool | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | inline |
| existCounterNode(CounterType node) const -> bool | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | inline |
| existEdge(CounterEdge< CounterType, Cost > edge) const -> bool | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | inline |
| explore_bfs(CounterType from) const -> std::vector< CounterType > | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | inline |
| explore_bfs_protected(CounterType from, std::optional< std::reference_wrapper< std::unordered_set< CounterType > > > pre_visited=std::nullopt) const -> std::vector< CounterType > | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | inlineprotected |
| explore_dfs(CounterType from) const -> std::vector< CounterType > | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | inline |
| explore_dfs_protected(CounterType from, std::optional< std::reference_wrapper< std::unordered_set< CounterType > > > pre_visited=std::nullopt) const -> std::vector< CounterType > | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | inlineprotected |
| graph | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | protected |
| modifyEdge(CounterEdge< CounterType, Cost > edge, Cost new_cost) -> std::optional< edge_error > | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | inlinevirtual |
| node_counter | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | protected |
| num_edge | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | protected |
| num_node | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | protected |
| registerEdge(CounterEdge< CounterType, Cost > edge) -> void | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | inlinevirtual |
| registerNode(const NodeType &node) -> CounterType | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | inline |
| scc() -> std::vector< DiGraph > const | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | |
| singular_shortest_path(CounterType start, CounterType end) const -> std::pair< std::unordered_map< CounterType, Cost >, std::unordered_map< CounterType, CounterType > > | lean_graph::DiGraph< NodeType, Cost, CounterType, H > | inlinevirtual |
1.13.1