Implementation of Breadth First Search algorithm over a graph. More...
#include "bfs.h"
Functions | |
| void | bfs_search (Graph const &graph, int s, vector< int > &dist, vector< int > &pred) |
| Given (directed or undirected) graph, perform a breadth first search starting from the provided source vertex, and compute the BFS distance and predecessor vertex for all vertices in the graph. | |
Implementation of Breadth First Search algorithm over a graph.
| void bfs_search | ( | const Graph & | graph, | |
| int | s, | |||
| vector< int > & | dist, | |||
| vector< int > & | pred | |||
| ) |
Given (directed or undirected) graph, perform a breadth first search starting from the provided source vertex, and compute the BFS distance and predecessor vertex for all vertices in the graph.
| graph | the graph to be processed. | |
| s | the initial vertex (0 <= s < n) from which to search. | |
| dist | the computed dist[] array for each vertex from s. | |
| pred | the computed pred[] array to be able to recover path. |
Algorithm Development Kit 1.0