![]()  | 
  
    Rosetta
    2019.12
    
   | 
 

Files | |
| file | ArrayPool.cc | 
| ArrayPool class declaration and implementation.  | |
| file | ArrayPool.fwd.hh | 
| Forward declaration for ArrayPool classes.  | |
| file | ArrayPool.hh | 
| ArrayPool class declaration and implementation.  | |
| file | BFS_prune.hh | 
| A breadth first search with pruning for boost graphs.  | |
| file | DFS_sort.hh | 
| A depth first search with sorting for edge visitation.  | |
| file | Digraph.cc | 
| directed graph base classes  | |
| file | Digraph.fwd.hh | 
| directed graph base class forward declarations  | |
| file | Digraph.hh | 
| generic directed graph class header  | |
| file | DisjointSets.cc | 
| file | DisjointSets.fwd.hh | 
| DisjointSets class forward declaration.  | |
| file | DisjointSets.hh | 
| file | Graph.cc | 
| graph base classes  | |
| file | Graph.fwd.hh | 
| graph base class forward declarations  | |
| file | Graph.hh | 
| generic graph class header  | |
| file | graph_util.cc | 
| file | graph_util.hh | 
| generic graph class header  | |
| file | LowMemGraph.cc | 
| A lower memory version of utility::graph::Graph with three key limitations.  | |
| file | LowMemGraph.fwd.hh | 
| A lower memory version of utility::graph::Graph with three key limitations.  | |
| file | LowMemGraph.hh | 
| A lower memory version of utility::graph::Graph with three key limitations.  | |
| file | ring_detection.hh | 
| Algorithms for working with rings in boost graphs.  | |
| file | RingDetection.hh | 
| file | unordered_object_pool.fwd.hpp | 
| file | unordered_object_pool.hpp | 
| file | UpperEdgeGraph.fwd.hh | 
| file | UpperEdgeGraph.hh | 
| templated graph for fast edge additions  | |
| file | UpperEdgeGraph.srlz.hh | 
| templated graph for fast edge additions  | |
 1.8.7