Mackey  V3.3
A C++ library for computing RO(G) graded homology
Graph.hpp File Reference

Contains the classes mackey::Neighborhood, mackey::Graph, mackey::ShortestPaths. More...

#include <vector>
#include <queue>
#include <set>
#include <iomanip>
#include "impl/Graph.ipp"
Include dependency graph for Graph.hpp:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

class  Neighborhood< _node, _edge, container_t, Args >
 The adjecency list of a node in a graph. More...
 
struct  Neighborhood< _node, _edge, container_t, Args >::const_iterator
 Constant iterator traversing edges with fixed start. More...
 
class  Graph< _neighborhood >
 A directed graph. More...
 
class  ShortestPaths< graph_t, policy_t >
 The shortest paths from a collection of sources to all points in a graph. More...
 

Namespaces

 mackey
 Everything in this library is under this namespace.
 

Functions

template<typename neighborhood_t >
std::ostream & operator<< (std::ostream &os, const Graph< neighborhood_t > &G)
 
template<typename graph_t , typename policy_t >
std::ostream & operator<< (std::ostream &os, const ShortestPaths< graph_t, policy_t > &D)
 

Detailed Description