| operations_research::ArcIndexOrderingByTailNode< GraphType > | Logically this class should be defined inside OptimizeGraphLayout, but compilation fails if we do that because C++98 doesn't allow instantiation of member templates with function-scoped types as template parameters, which in turn is because those function-scoped types lack linkage |
| operations_research::BellmanFord | |
| operations_research::ConnectedComponents | Template class implementing a Union-Find algorithm with path compression for maintaining the connected components of a graph |
| operations_research::CostValueCycleHandler< ArcIndexType > | |
| operations_research::DijkstraSP | Namespace |
| operations_research::EbertGraph< NodeIndexType, ArcIndexType > | Most users should only use StarGraph, which is EbertGraph<int32, int32>, and other type shortcuts; see the bottom of this file |
| operations_research::EbertGraph< NodeIndexType, ArcIndexType >::IncidentArcIterator | Iterator class for traversing the arcs incident to a given node in the graph |
| operations_research::EbertGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator | Iterator class for traversing the incoming arcs associated to a given node |
| operations_research::EbertGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | Iterator class for traversing the outgoing arcs associated to a given node |
| operations_research::EbertGraphCore< NodeIndexType, ArcIndexType, DerivedGraph > | A template for the base class that holds the functionality that exists in common between the EbertGraph<> template and the ForwardEbertGraph<> template |
| operations_research::EbertGraphCore< NodeIndexType, ArcIndexType, DerivedGraph >::ArcIterator | Iterator class for traversing the arcs in the graph |
| operations_research::EbertGraphCore< NodeIndexType, ArcIndexType, DerivedGraph >::CycleHandlerForAnnotatedArcs | |
| operations_research::EbertGraphCore< NodeIndexType, ArcIndexType, DerivedGraph >::NodeIterator | Iterator class for traversing all the nodes in the graph |
| operations_research::ForwardEbertGraph< NodeIndexType, ArcIndexType > | A forward-star-only graph representation for greater efficiency in those algorithms that don't need reverse arcs |
| operations_research::ForwardEbertGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | Iterator class for traversing the arcs incident to a given node in the graph |
| operations_research::graph_traits< GraphType > | Traits for EbertGraphCore types, for use in testing and clients that work with both forward-only and forward/reverse graphs |
| operations_research::graph_traits< ForwardEbertGraph< NodeIndexType, ArcIndexType > > | |
| operations_research::HamiltonianPathSolver< T > | |
| operations_research::LinearSumAssignment< GraphType > | |
| operations_research::LinearSumAssignment< GraphType >::BipartiteLeftNodeIterator | |
| operations_research::MaxFlow | |
| operations_research::MinCostFlow | |
| operations_research::TailArrayBuilder< GraphType, has_reverse_arcs > | The TailArrayBuilder for graphs with reverse arcs does nothing |
| operations_research::TailArrayBuilder< GraphType, false > | The TailArrayBuilder for graphs without reverse arcs calls the appropriate method on the graph from the TailArrayBuilder constructor |
| operations_research::TailArrayManager< GraphType > | |
| operations_research::TailArrayReleaser< GraphType, has_reverse_arcs > | The TailArrayReleaser for graphs with reverse arcs does nothing |
| operations_research::TailArrayReleaser< GraphType, false > | The TailArrayReleaser for graphs without reverse arcs calls the appropriate method on the graph from the TailArrayReleaser constructor |
| PermutationCycleHandler | |
