Home Original page

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

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

Definition at line 662 of file graph.h.

#include <graph.h>

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

Public Types

using OutgoingArcIterator
using OutgoingHeadIterator = ArcHeadIterator<ListGraph, OutgoingArcIterator>
Public Types inherited from util::BaseGraph< ListGraph< int32_t, int32_t >, int32_t, int32_t, false >
typedef int32_t NodeIndex
typedef int32_t ArcIndex

Public Member Functions

 ListGraph ()=default
 ListGraph (NodeIndexType num_nodes, ArcIndexType arc_capacity)
void AddNode (NodeIndexType node)
ArcIndexType AddArc (NodeIndexType tail, NodeIndexType head)
NodeIndexType Tail (ArcIndexType arc) const
NodeIndexType Head (ArcIndexType arc) const
ArcIndexType OutDegree (NodeIndexType node) const
BeginEndWrapper< OutgoingArcIterator > OutgoingArcs (NodeIndexType node) const
BeginEndWrapper< OutgoingArcIterator > OutgoingArcsStartingFrom (NodeIndexType node, ArcIndexType from) const
BeginEndWrapper< OutgoingHeadIterator > operator[] (NodeIndexType node) const
void ReserveNodes (NodeIndexType bound) override
void ReserveArcs (ArcIndexType bound) override
bool IsArcValid (ArcIndexType arc) const
Public Member Functions inherited from util::BaseGraph< ListGraph< 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

Static Public Attributes inherited from util::BaseGraph< ListGraph< 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< ListGraph< 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< ListGraph< 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_

◆ OutgoingArcIterator

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

Initial value:

ChasingIterator<ArcIndexType, Base::kNilArc, OutgoingArcIteratorTag>

Definition at line 707 of file graph.h.

◆ OutgoingHeadIterator

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

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

◆ ListGraph() [2/2]

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

util::ListGraph< NodeIndexType, ArcIndexType >::ListGraph ( NodeIndexType num_nodes,
ArcIndexType arc_capacity )
inline

◆ AddArc()

template<typename NodeIndexType, typename ArcIndexType>

ArcIndexType util::ListGraph< NodeIndexType, ArcIndexType >::AddArc ( NodeIndexType tail,
NodeIndexType head )

◆ AddNode()

template<typename NodeIndexType, typename ArcIndexType>

void util::ListGraph< NodeIndexType, ArcIndexType >::AddNode ( NodeIndexType node)

◆ Head()

template<typename NodeIndexType, typename ArcIndexType>

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

◆ IsArcValid()

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

bool util::BaseGraph< ListGraph< NodeIndexType, ArcIndexType >, NodeIndexType, ArcIndexType, HasNegativeReverseArcs >::IsArcValid ( ArcIndexType arc) const
inline

◆ operator[]()

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

◆ OutDegree()

template<typename NodeIndexType, typename ArcIndexType>

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

◆ OutgoingArcs()

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

◆ OutgoingArcsStartingFrom()

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

◆ ReserveArcs()

template<typename NodeIndexType, typename ArcIndexType>

void util::ListGraph< NodeIndexType, ArcIndexType >::ReserveArcs ( ArcIndexType bound)
override

◆ ReserveNodes()

template<typename NodeIndexType, typename ArcIndexType>

void util::ListGraph< NodeIndexType, ArcIndexType >::ReserveNodes ( NodeIndexType bound)
override

◆ Tail()

template<typename NodeIndexType, typename ArcIndexType>

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

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