Home Original page

Google OR-Tools: util::CompleteBipartiteGraph< NodeIndexType, ArcIndexType

template<typename NodeIndexType = int32_t, typename ArcIndexType = int32_t>
class util::CompleteBipartiteGraph< NodeIndexType, ArcIndexType >

Definition at line 1945 of file graph.h.

#include <graph.h>

util::BaseGraph< CompleteBipartiteGraph< int32_t, int32_t >, int32_t, int32_t, false >

Public Member Functions

 CompleteBipartiteGraph (NodeIndexType left_nodes, NodeIndexType right_nodes)
ArcIndexType GetArc (NodeIndexType left_node, NodeIndexType right_node) const
NodeIndexType Head (ArcIndexType arc) const
NodeIndexType Tail (ArcIndexType arc) const
ArcIndexType OutDegree (NodeIndexType node) const
IntegerRange< ArcIndexType > OutgoingArcs (NodeIndexType node) const
IntegerRange< ArcIndexType > OutgoingArcsStartingFrom (NodeIndexType node, ArcIndexType from) const
IntegerRange< NodeIndexType > operator[] (NodeIndexType node) const
Public Member Functions inherited from util::BaseGraph< CompleteBipartiteGraph< int32_t, int32_t >, int32_t, int32_t, false >
 BaseGraph ()
BaseGraph & operator= (const BaseGraph &)=default
virtual ~BaseGraph ()=default
int32_t num_nodes () const
int32_t size () const
int32_t num_arcs () const
IntegerRange< NodeIndex > AllNodes () const
IntegerRange< ArcIndex > AllForwardArcs () const
bool IsNodeValid (int32_t node) const
bool IsArcValid (int32_t arc) const
int32_t node_capacity () const
int32_t arc_capacity () const
virtual void ReserveNodes (int32_t bound)
virtual void ReserveArcs (int32_t bound)
void Reserve (int32_t node_capacity, int32_t arc_capacity)
void FreezeCapacities ()
virtual void Build (std::vector< int32_t > *permutation)
virtual bool IsBuilt () const

Additional Inherited Members

Public Types inherited from util::BaseGraph< CompleteBipartiteGraph< int32_t, int32_t >, int32_t, int32_t, false >
typedef int32_t NodeIndex
typedef int32_t ArcIndex
Static Public Attributes inherited from util::BaseGraph< CompleteBipartiteGraph< int32_t, int32_t >, int32_t, int32_t, false >
static constexpr bool kHasNegativeReverseArcs
static constexpr int32_t kNilNode
static constexpr int32_t kNilArc
Protected Member Functions inherited from util::BaseGraph< CompleteBipartiteGraph< int32_t, int32_t >, int32_t, int32_t, false >
void ComputeCumulativeSum (internal::Vector< int32_t, int32_t > *v)
void BuildStartAndForwardHead (internal::SVector< int32_t, int32_t > *head, internal::Vector< int32_t, int32_t > *start, std::vector< int32_t > *permutation)
Protected Attributes inherited from util::BaseGraph< CompleteBipartiteGraph< int32_t, int32_t >, int32_t, int32_t, false >
int32_t num_nodes_
int32_t node_capacity_
int32_t num_arcs_
int32_t arc_capacity_
bool const_capacities_

template<typename NodeIndexType = int32_t, typename ArcIndexType = int32_t>

◆ GetArc()

template<typename NodeIndexType, typename ArcIndexType>

ArcIndexType util::CompleteBipartiteGraph< NodeIndexType, ArcIndexType >::GetArc ( NodeIndexType left_node,
NodeIndexType right_node ) const

◆ Head()

template<typename NodeIndexType, typename ArcIndexType>

NodeIndexType util::CompleteBipartiteGraph< NodeIndexType, ArcIndexType >::Head ( ArcIndexType arc) const

◆ operator[]()

◆ OutDegree()

template<typename NodeIndexType, typename ArcIndexType>

ArcIndexType util::CompleteBipartiteGraph< NodeIndexType, ArcIndexType >::OutDegree ( NodeIndexType node) const

◆ OutgoingArcs()

◆ OutgoingArcsStartingFrom()

template<typename NodeIndexType, typename ArcIndexType>

◆ Tail()

template<typename NodeIndexType, typename ArcIndexType>

NodeIndexType util::CompleteBipartiteGraph< NodeIndexType, ArcIndexType >::Tail ( ArcIndexType arc) const

The documentation for this class was generated from the following file: