![]() |
TheAlgorithms/C++ 1.0.0
All the algorithms implemented in C++
|
This is the complete list of members for graph::RootedTree, including all inherited members.
| add_edge(T u, T v, bool bidir=true) | graph::Graph< T > | inline |
| adjacency_list | graph::Graph< T > | private |
| breadth_first_search(T src) | graph::Graph< T > | inline |
| Graph()=default (defined in graph::Graph< T >) | graph::Graph< T > | |
| Graph(size_t N, const std::vector< std::pair< int, int > > &undirected_edges) | graph::Graph< T > | inline |
| level | graph::RootedTree | |
| neighbors | graph::Graph< T > | |
| number_of_vertices() const | graph::Graph< T > | inline |
| parent | graph::RootedTree | |
| populate_parents() | graph::RootedTree | inlineprotected |
| root | graph::RootedTree | |
| RootedTree(const std::vector< std::pair< int, int > > &undirected_edges, int root_) | graph::RootedTree | inline |