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

Contains the classes mackey::bicolored_edge_with_id, mackey::MinLength, mackey::MinColorsLength. More...

#include "Graph.hpp"
#include "impl/Graph_Policies.ipp"
Include dependency graph for Graph_Policies.hpp:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

struct  bicolored_edge_with_id
 An edge with two possible colors and a numerical id. More...
 
class  MinLength< graph_t >
 ShortestPaths policy that minimizes the length of each path. More...
 
class  MinColorsLength< graph_t >
 Dijkstra policy that minimizes the color alterations and length. More...
 

Namespaces

 mackey
 Everything in this library is under this namespace.
 

Functions

std::ostream & operator<< (std::ostream &os, const bicolored_edge_with_id &edge)
 Prints edge to output stream in .dot format. More...
 
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