#include "xf_graph_L3.hpp"
event <int> bfs ( xf::graph::L3::Handle& handle, uint32_t sourceID, xf::graph::Graph <uint32_t, uint32_t> gr, uint32_t* predecent, uint32_t* distance )
bfs Implements the directed graph traversal by breath-first search algorithm
Parameters:
| handle | Graph library L3 handle |
| sourceID | The source vertex ID in this search, starting from 0 |
| gr | Input, CSR graph of IDs’ type of uint32_t and weights’ type of uint32_t |
| predecent | The result of parent index of each vertex |
| distance | The distance result from giving source vertex for each vertex |