ebert_graph.h File Reference

#include <algorithm>
#include <cstdint>
#include <limits>
#include <memory>
#include <string>
#include <utility>
#include <vector>
#include "absl/strings/str_cat.h"
#include "ortools/base/logging.h"
#include "ortools/util/permutation.h"
#include "ortools/util/zvector.h"

Go to the source code of this file.

Classes
class	operations_research::StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >
class	operations_research::StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::NodeIterator
	Iterator class for traversing all the nodes in the graph. More...
class	operations_research::StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::ArcIterator
	Iterator class for traversing the arcs in the graph. More...
class	operations_research::StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::OutgoingArcIterator
	Iterator class for traversing the outgoing arcs associated to a given node. More...
class	operations_research::PermutationIndexComparisonByArcHead< NodeIndexType, ArcIndexType >
class	operations_research::ForwardStaticGraph< NodeIndexType, ArcIndexType >
class	operations_research::ForwardStaticGraph< NodeIndexType, ArcIndexType >::CycleHandlerForAnnotatedArcs
class	operations_research::EbertGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >
class	operations_research::EbertGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::CycleHandlerForAnnotatedArcs
class	operations_research::EbertGraph< NodeIndexType, ArcIndexType >
	Forward declarations. More...
class	operations_research::EbertGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator
class	operations_research::EbertGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator
	Iterator class for traversing the incoming arcs associated to a given node. More...
class	operations_research::ForwardEbertGraph< NodeIndexType, ArcIndexType >
struct	operations_research::graph_traits< GraphType >
struct	operations_research::graph_traits< ForwardEbertGraph< NodeIndexType, ArcIndexType > >
struct	operations_research::graph_traits< ForwardStaticGraph< NodeIndexType, ArcIndexType > >
struct	operations_research::or_internal::TailArrayBuilder< GraphType, has_reverse_arcs >
struct	operations_research::or_internal::TailArrayBuilder< GraphType, false >
struct	operations_research::or_internal::TailArrayReleaser< GraphType, has_reverse_arcs >
struct	operations_research::or_internal::TailArrayReleaser< GraphType, false >
class	operations_research::TailArrayManager< GraphType >
class	operations_research::ArcFunctorOrderingByTailAndHead< GraphType >
class	operations_research::or_internal::GraphBuilderFromArcs< GraphType, is_dynamic >
class	operations_research::or_internal::GraphBuilderFromArcs< GraphType, true >
class	operations_research::AnnotatedGraphBuildManager< GraphType >

Namespaces
namespace	operations_research
	In SWIG mode, we don't want anything besides these top-level includes.
namespace	operations_research::or_internal

Typedefs
using	operations_research::NodeIndex = BlossomGraph::NodeIndex
typedef int32_t	operations_research::ArcIndex
typedef int64_t	operations_research::FlowQuantity
using	operations_research::CostValue = BlossomGraph::CostValue
typedef EbertGraph< NodeIndex, ArcIndex >	operations_research::StarGraph
typedef ForwardEbertGraph< NodeIndex, ArcIndex >	operations_research::ForwardStarGraph
typedef ForwardStaticGraph< NodeIndex, ArcIndex >	operations_research::ForwardStarStaticGraph
typedef ZVector< NodeIndex >	operations_research::NodeIndexArray
typedef ZVector< ArcIndex >	operations_research::ArcIndexArray
typedef ZVector< FlowQuantity >	operations_research::QuantityArray
typedef ZVector< CostValue >	operations_research::CostArray

Functions
template<typename GraphType >
bool	operations_research::BuildLineGraph (const GraphType &graph, GraphType *const line_graph)