ExplicitGraph.h File Reference

Header file for the class template ExplicitAdjacency, the arcs of a weighted graph given one by one, and for the class template ExplicitGraph, which implements the Domain concept [see Domain.h] for such a graph, with a heuristic given node by node, such as the map of Romania of Russell and Norvig. More...

#include <cstddef>
#include <cstdint>
#include <stdexcept>
#include <utility>
#include <vector>
#include "PBeFS/astar/Domain.h"
#include "PBeFS/astar/Structures.h"

Go to the source code of this file.

Classes
class	ExplicitGraph< Cost >
	a weighted graph given explicitly, searched from a source to a target More...

Namespaces
namespace	PBeFS_di_unipi_it
	namespace for the Parallel Best-First Search library

Detailed Description

Header file for the class template ExplicitAdjacency, the arcs of a weighted graph given one by one, and for the class template ExplicitGraph, which implements the Domain concept [see Domain.h] for such a graph, with a heuristic given node by node, such as the map of Romania of Russell and Norvig.

The adjacency is that of the set of data structures [see Structures.h]: lists of the library for the sets own and std, the graph in compressed rows of Boost for the set boost, and the GraphBuilder of ADS, frozen into its ArrayGraph, for the set ads.

Author

Donato Meoli
Dipartimento di Informatica
Università di Pisa

Copyright

© by Donato Meoli