|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <iostream>#include <iomanip>#include <aleph.H>#include <tpl_graph.H>#include <Zero_One_BFS.H>Go to the source code of this file.
Typedefs | |
| using | Node_Info = char |
| using | Arc_Info = int |
| using | GT = List_Graph< Graph_Node< Node_Info >, Graph_Arc< Arc_Info > > |
Functions | |
| int | main () |
| using Arc_Info = int |
Definition at line 41 of file zero_one_bfs_example.cc.
| using GT = List_Graph<Graph_Node<Node_Info>, Graph_Arc<Arc_Info> > |
Definition at line 42 of file zero_one_bfs_example.cc.
| using Node_Info = char |
Definition at line 40 of file zero_one_bfs_example.cc.
| int main | ( | ) |
Definition at line 44 of file zero_one_bfs_example.cc.
References Aleph::divide_and_conquer_partition_dp(), GraphCommon< GT, Node, Arc >::get_node_it(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::Zero_One_BFS< GT, Distance, Itor, SA >::paint_min_paths_tree().