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

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

AllForwardArcs() constutil::BaseGraph< int32_t, int32_t, false >
AllNodes() constutil::BaseGraph< int32_t, int32_t, false >
arc_capacity() constutil::BaseGraph< int32_t, int32_t, false >
ArcIndex typedefutil::BaseGraph< int32_t, int32_t, false >
BaseGraph()util::BaseGraph< int32_t, int32_t, false >inline
BaseGraph(const BaseGraph &)=defaultutil::BaseGraph< int32_t, int32_t, false >
BuildStartAndForwardHead(SVector< int32_t > *head, std::vector< int32_t > *start, std::vector< int32_t > *permutation)util::BaseGraph< int32_t, int32_t, false >protected
CompleteBipartiteGraph(NodeIndexType left_nodes, NodeIndexType right_nodes)util::CompleteBipartiteGraph< NodeIndexType, ArcIndexType >inline
ComputeCumulativeSum(std::vector< int32_t > *v)util::BaseGraph< int32_t, int32_t, false >protected
FreezeCapacities()util::BaseGraph< int32_t, int32_t, false >
GroupForwardArcsByFunctor(const A &a, B *b)util::BaseGraph< int32_t, int32_t, false >inline
Head(ArcIndexType arc) constutil::CompleteBipartiteGraph< NodeIndexType, ArcIndexType >
IsArcValid(int32_t arc) constutil::BaseGraph< int32_t, int32_t, false >inline
IsNodeValid(int32_t node) constutil::BaseGraph< int32_t, int32_t, false >inline
kNilArcutil::BaseGraph< int32_t, int32_t, false >static
kNilNodeutil::BaseGraph< int32_t, int32_t, false >static
max_end_arc_index() constutil::BaseGraph< int32_t, int32_t, false >inline
node_capacity() constutil::BaseGraph< int32_t, int32_t, false >
NodeIndex typedefutil::BaseGraph< int32_t, int32_t, false >
num_arcs() constutil::BaseGraph< int32_t, int32_t, false >inline
num_nodes() constutil::BaseGraph< int32_t, int32_t, false >inline
operator=(const BaseGraph &)=defaultutil::BaseGraph< int32_t, int32_t, false >
operator[](NodeIndexType node) constutil::CompleteBipartiteGraph< NodeIndexType, ArcIndexType >
OutDegree(NodeIndexType node) constutil::CompleteBipartiteGraph< NodeIndexType, ArcIndexType >
OutgoingArcs(NodeIndexType node) constutil::CompleteBipartiteGraph< NodeIndexType, ArcIndexType >
OutgoingArcsStartingFrom(NodeIndexType node, ArcIndexType from) constutil::CompleteBipartiteGraph< NodeIndexType, ArcIndexType >
Reserve(int32_t node_capacity, int32_t arc_capacity)util::BaseGraph< int32_t, int32_t, false >inline
ReserveArcs(int32_t bound)util::BaseGraph< int32_t, int32_t, false >inlinevirtual
ReserveNodes(int32_t bound)util::BaseGraph< int32_t, int32_t, false >inlinevirtual
size() constutil::BaseGraph< int32_t, int32_t, false >inline
Tail(ArcIndexType arc) constutil::CompleteBipartiteGraph< NodeIndexType, ArcIndexType >
~BaseGraph()=defaultutil::BaseGraph< int32_t, int32_t, false >virtual