P4C
The P4 Compiler
|
Custom BFS visitor for finding a shortest path between two nodes. More...
#include <table_flow_graph.h>
Public Member Functions | |
BFSPathFinder (const Graph &g) | |
void | examine_edge (typename Graph::edge_descriptor e, const Graph &g) |
std::vector< typename Graph::vertex_descriptor > | find_path (typename Graph::vertex_descriptor src, typename Graph::vertex_descriptor dst) |
Custom BFS visitor for finding a shortest path between two nodes.