Google OR-Tools v9.12
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator Member List

This is the complete list of members for util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator, including all inherited members.

AddArc(NodeIndexType tail, NodeIndexType head)util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
AddNode(NodeIndexType node)util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
AllForwardArcs() constutil::BaseGraph< NodeIndexType, ArcIndexType, true >
AllForwardArcs() constutil::BaseGraph< NodeIndexType, ArcIndexType, true >
AllNodes() constutil::BaseGraph< NodeIndexType, ArcIndexType, true >
AllNodes() constutil::BaseGraph< NodeIndexType, ArcIndexType, true >
arc_capacity() constutil::BaseGraph< NodeIndexType, ArcIndexType, true >
arc_capacity() constutil::BaseGraph< NodeIndexType, ArcIndexType, true >
ArcIndex typedefutil::BaseGraph< NodeIndexType, ArcIndexType, true >
BaseGraph()util::BaseGraph< NodeIndexType, ArcIndexType, true >inline
BaseGraph(const BaseGraph &)=defaultutil::BaseGraph< NodeIndexType, ArcIndexType, true >
BaseGraph()util::BaseGraph< NodeIndexType, ArcIndexType, true >inline
BaseGraph(const BaseGraph &)=defaultutil::BaseGraph< NodeIndexType, ArcIndexType, true >
Build()util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIteratorinline
Build(std::vector< ArcIndexType > *permutation)util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
BuildStartAndForwardHead(SVector< NodeIndexType > *head, std::vector< ArcIndexType > *start, std::vector< ArcIndexType > *permutation)util::BaseGraph< NodeIndexType, ArcIndexType, true >protected
BuildStartAndForwardHead(SVector< NodeIndexType > *head, std::vector< ArcIndexType > *start, std::vector< ArcIndexType > *permutation)util::BaseGraph< NodeIndexType, ArcIndexType, true >protected
ComputeCumulativeSum(std::vector< ArcIndexType > *v)util::BaseGraph< NodeIndexType, ArcIndexType, true >protected
ComputeCumulativeSum(std::vector< ArcIndexType > *v)util::BaseGraph< NodeIndexType, ArcIndexType, true >protected
DEFINE_STL_ITERATOR_FUNCTIONS(OutgoingArcIterator)util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
FreezeCapacities()util::BaseGraph< NodeIndexType, ArcIndexType, true >
FreezeCapacities()util::BaseGraph< NodeIndexType, ArcIndexType, true >
Head(ArcIndexType arc) constutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
IncomingArcs(NodeIndexType node) constutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
IncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) constutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
InDegree(NodeIndexType node) constutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
Index() constutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIteratorinline
IsArcValid(ArcIndexType arc) constutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
IsArcValid(ArcIndexType arc) constutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIteratorinline
IsNodeValid(NodeIndexType node) constutil::BaseGraph< NodeIndexType, ArcIndexType, true >inline
IsNodeValid(NodeIndexType node) constutil::BaseGraph< NodeIndexType, ArcIndexType, true >inline
kHasNegativeReverseArcsutil::BaseGraph< NodeIndexType, ArcIndexType, true >static
kHasNegativeReverseArcsutil::BaseGraph< NodeIndexType, ArcIndexType, true >static
kNilArcutil::BaseGraph< NodeIndexType, ArcIndexType, true >static
kNilArcutil::BaseGraph< NodeIndexType, ArcIndexType, true >static
kNilNodeutil::BaseGraph< NodeIndexType, ArcIndexType, true >static
kNilNodeutil::BaseGraph< NodeIndexType, ArcIndexType, true >static
Next()util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIteratorinline
node_capacity() constutil::BaseGraph< NodeIndexType, ArcIndexType, true >
node_capacity() constutil::BaseGraph< NodeIndexType, ArcIndexType, true >
NodeIndex typedefutil::BaseGraph< NodeIndexType, ArcIndexType, true >
num_arcs() constutil::BaseGraph< NodeIndexType, ArcIndexType, true >inline
num_arcs() constutil::BaseGraph< NodeIndexType, ArcIndexType, true >inline
num_nodes() constutil::BaseGraph< NodeIndexType, ArcIndexType, true >inline
num_nodes() constutil::BaseGraph< NodeIndexType, ArcIndexType, true >inline
Ok() constutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIteratorinline
operator=(const OutgoingArcIterator &)=defaultutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
util::BaseGraph< NodeIndexType, ArcIndexType, true >::operator=(const BaseGraph &)=defaultutil::BaseGraph< NodeIndexType, ArcIndexType, true >
operator[](NodeIndexType node) constutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
OppositeArc(ArcIndexType arc) constutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
OppositeIncomingArcs(NodeIndexType node) constutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
OppositeIncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) constutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
OutDegree(NodeIndexType node) constutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
OutgoingArcIterator(const OutgoingArcIterator &)=defaultutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
OutgoingArcIterator(const ReverseArcMixedGraph &graph, NodeIndexType node)util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIteratorinline
OutgoingArcIterator(const ReverseArcMixedGraph &graph, NodeIndexType node, ArcIndexType arc)util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIteratorinline
OutgoingArcs(NodeIndexType node) constutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
OutgoingArcsStartingFrom(NodeIndexType node, ArcIndexType from) constutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
OutgoingOrOppositeIncomingArcs(NodeIndexType node) constutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
OutgoingOrOppositeIncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) constutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
Reserve(NodeIndexType node_capacity, ArcIndexType arc_capacity)util::BaseGraph< NodeIndexType, ArcIndexType, true >inline
Reserve(NodeIndexType node_capacity, ArcIndexType arc_capacity)util::BaseGraph< NodeIndexType, ArcIndexType, true >inline
ReserveArcs(ArcIndexType bound) overrideutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIteratorvirtual
ReserveNodes(NodeIndexType bound)util::BaseGraph< NodeIndexType, ArcIndexType, true >inlinevirtual
ReserveNodes(NodeIndexType bound)util::BaseGraph< NodeIndexType, ArcIndexType, true >inlinevirtual
ReverseArcMixedGraph()util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIteratorinline
ReverseArcMixedGraph(NodeIndexType num_nodes, ArcIndexType arc_capacity)util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIteratorinline
size() constutil::BaseGraph< NodeIndexType, ArcIndexType, true >inline
size() constutil::BaseGraph< NodeIndexType, ArcIndexType, true >inline
Tail(ArcIndexType arc) constutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
~BaseGraph()=defaultutil::BaseGraph< NodeIndexType, ArcIndexType, true >virtual
~BaseGraph()=defaultutil::BaseGraph< NodeIndexType, ArcIndexType, true >virtual