sal/data/graph/search.h
| initialize_single_source | |
| bfs | |
| dfs | |
| dfs_recurse | |
| dfs_visit | |
| BFS_vertex | |
|---|---|
| DFS_vertex | |
| BFS_visitor | |
| DFS_visitor | |
| Graph_single_visitor |
initialize_single_source ¶
Declaration
template <typename Property_map, typename Graph>
void initialize_single_source(Property_map& property, const Graph& g, typename Graph::vertex_type s);Parameters
| property | |
| g | |
| s |
Return value
Example
Discussion
bfs ¶
Declaration
template <typename Graph, typename Visitor = BFS_visitor>
BPM<Graph> bfs(const Graph& g, typename Graph::vertex_type s, Visitor&& visitor = BFS_visitor{});Parameters
| g | |
| s | |
| visitor |
Return value
Example
Discussion
dfs ¶
Declaration
template <typename Graph, typename Visitor = DFS_visitor>
DPM<Graph> dfs(const Graph& g, Visitor&& visitor = DFS_visitor{});
template <typename Graph>
DPM<Graph> dfs(const Graph& g, typename Graph::vertex_type s, int);Parameters
| g | |
| visitor | |
| s | |
| int |
Return value
Example
Discussion
dfs_recurse ¶
Declaration
template <typename Graph, typename Visitor = DFS_visitor>
DPM<Graph> dfs_recurse(const Graph& g, Visitor&& visitor = DFS_visitor{});
template <typename Graph, typename Visitor = DFS_visitor>
DPM<Graph> dfs_recurse(const Graph& g, typename Graph::vertex_type u, Visitor&& visitor = DFS_visitor{});Parameters
| g | |
| visitor | |
| u |
Return value
Example
Discussion
dfs_visit ¶
Declaration
template <typename Graph, typename Visitor, typename Property_map>
void dfs_visit(const Graph& g, typename Graph::vertex_type u, Property_map& property, size_t& explore_time, Visitor& visitor);Parameters
| g | |
| u | |
| property | |
| explore_time | |
| visitor |
Return value
Example
Discussion