Google OR-Tools v9.15
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType > Member List

This is the complete list of members for operations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >, including all inherited members.

AddArc(NodeIndexType tail, NodeIndexType head)operations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >
AddNode(NodeIndexType node)operations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >
AllForwardArcs() constutil::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >
AllNodes() constutil::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >
arc_capacity() constutil::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >
ArcIndex typedefutil::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >
BaseGraph()util::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >inline
Build(std::vector< int32_t > *permutation)util::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >inlinevirtual
BuildStartAndForwardHead(internal::SVector< int32_t, int32_t > *head, internal::Vector< int32_t, int32_t > *start, std::vector< int32_t > *permutation)util::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >protected
ComputeCumulativeSum(internal::Vector< int32_t, int32_t > *v)util::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >protected
FreezeCapacities()util::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >
Head(ArcIndexType arc) constoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >
IncomingArcIterator typedefoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >
IncomingArcs(NodeIndexType node) constoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >inline
IncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) constoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >inline
InDegree(NodeIndexType node) constoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >
IsArcValid(ArcIndexType arc) constoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >inline
util::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >::IsArcValid(int32_t arc) constutil::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >inline
IsBuilt() constutil::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >inlinevirtual
IsNodeValid(int32_t node) constutil::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >inline
kHasNegativeReverseArcsutil::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >static
kNilArcutil::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >static
kNilNodeutil::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >static
node_capacity() constutil::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >
NodeIndex typedefutil::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >
num_arcs() constutil::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >inline
num_nodes() constutil::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >inline
operator=(const BaseGraph &)=defaultutil::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >
operator[](NodeIndexType node) constoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >
OppositeArc(ArcIndexType arc) constoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >
OppositeIncomingArcIterator typedefoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >
OppositeIncomingArcs(NodeIndexType node) constoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >inline
OppositeIncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) constoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >inline
OutDegree(NodeIndexType node) constoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >
OutgoingArcIterator typedefoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >
OutgoingArcs(NodeIndexType node) constoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >inline
OutgoingArcsStartingFrom(NodeIndexType node, ArcIndexType from) constoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >inline
OutgoingHeadIterator typedefoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >
OutgoingOrOppositeIncomingArcs(NodeIndexType node) constoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >
OutgoingOrOppositeIncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) constoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >
Reserve(int32_t node_capacity, int32_t arc_capacity)util::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >inline
ReserveArcs(ArcIndexType bound) overrideoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >
util::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >::ReserveArcs(int32_t bound)util::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >inlinevirtual
ReserveNodes(NodeIndexType bound) overrideoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >
util::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >::ReserveNodes(int32_t bound)util::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >inlinevirtual
ReverseArcListGraph()=defaultoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >
ReverseArcListGraph(NodeIndexType num_nodes, ArcIndexType arc_capacity)operations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >inline
size() constutil::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >inline
Tail(ArcIndexType arc) constoperations_research::ReverseArcListGraph< NodeIndexType, ArcIndexType >
~BaseGraph()=defaultutil::BaseGraph< ReverseArcListGraph< int32_t, int32_t >, int32_t, int32_t, true >virtual