bidirectional_bfs_example.cc File Reference

Illustrative example for Bidirectional Breadth-First Search (BFS). More...

#include <iostream>
#include <iomanip>
#include <string>
#include <utility>
#include <aleph.H>
#include <tpl_graph.H>
#include <Bidirectional_BFS.H>

Include dependency graph for bidirectional_bfs_example.cc:

Go to the source code of this file.

Typedefs
using	Node_Info = string
using	Arc_Info = int
using	GT = List_Graph< Graph_Node< Node_Info >, Graph_Arc< Arc_Info > >

Functions
int	main ()

Detailed Description

Illustrative example for Bidirectional Breadth-First Search (BFS).

Definition in file bidirectional_bfs_example.cc.

Typedef Documentation

Arc_Info

using Arc_Info = int

Definition at line 49 of file bidirectional_bfs_example.cc.

GT

using GT = List_Graph<Graph_Node<Node_Info>, Graph_Arc<Arc_Info> >

Definition at line 50 of file bidirectional_bfs_example.cc.

Node_Info

using Node_Info = string

Definition at line 48 of file bidirectional_bfs_example.cc.

Function Documentation

main()

int main

(

)

Definition at line 52 of file bidirectional_bfs_example.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::Path< GT >::for_each_node(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().