ida_star_example.cc File Reference

Illustrative example for Iterative Deepening A* (IDA*) algorithm. More...

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <limits>
#include <aleph.H>
#include <tpl_graph.H>
#include <tpl_dynMapTree.H>
#include <IDA_Star.H>

Include dependency graph for ida_star_example.cc:

Go to the source code of this file.

Classes
struct	Coord
struct	ManhattanH< GT >

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

Functions
int	main ()

Detailed Description

Illustrative example for Iterative Deepening A* (IDA*) algorithm.

Definition in file ida_star_example.cc.

Typedef Documentation

Arc_Info

using Arc_Info = int

Definition at line 64 of file ida_star_example.cc.

GT

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

Definition at line 65 of file ida_star_example.cc.

Node_Info

using Node_Info = Coord

Definition at line 63 of file ida_star_example.cc.

Function Documentation

main()

int main

(

)

Definition at line 77 of file ida_star_example.cc.

References Aleph::and, Aleph::DynList< T >::append(), Aleph::count(), Aleph::divide_and_conquer_partition_dp(), Aleph::Path< GT >::for_each_node(), Aleph::Dlink::insert(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), nodes, and y.