Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
Public Member Functions | Protected Attributes | List of all members
util::ReverseArcListGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator Class Reference

#include <graph.h>

Inheritance diagram for util::ReverseArcListGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator:
util::ReverseArcListGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator

Public Member Functions

 OppositeIncomingArcIterator (const ReverseArcListGraph &graph, NodeIndexType node)
 
 OppositeIncomingArcIterator (const ReverseArcListGraph &graph, NodeIndexType node, ArcIndexType arc)
 
bool Ok () const
 
ArcIndexType Index () const
 
void Next ()
 
 DEFINE_STL_ITERATOR_FUNCTIONS (OppositeIncomingArcIterator)
 

Protected Attributes

const ReverseArcListGraph & graph_
 
ArcIndexType index_
 

Detailed Description

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

Definition at line 1603 of file graph.h.

Constructor & Destructor Documentation

◆ OppositeIncomingArcIterator() [1/2]

template<typename NodeIndexType = int32_t, typename ArcIndexType = int32_t>
util::ReverseArcListGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator::OppositeIncomingArcIterator ( const ReverseArcListGraph & graph,
NodeIndexType node )
inline

Definition at line 1606 of file graph.h.

◆ OppositeIncomingArcIterator() [2/2]

template<typename NodeIndexType = int32_t, typename ArcIndexType = int32_t>
util::ReverseArcListGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator::OppositeIncomingArcIterator ( const ReverseArcListGraph & graph,
NodeIndexType node,
ArcIndexType arc )
inline

Definition at line 1611 of file graph.h.

Member Function Documentation

◆ DEFINE_STL_ITERATOR_FUNCTIONS()

template<typename NodeIndexType = int32_t, typename ArcIndexType = int32_t>
util::ReverseArcListGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator::DEFINE_STL_ITERATOR_FUNCTIONS ( OppositeIncomingArcIterator )

◆ Index()

template<typename NodeIndexType = int32_t, typename ArcIndexType = int32_t>
ArcIndexType util::ReverseArcListGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator::Index ( ) const
inline

Definition at line 1620 of file graph.h.

◆ Next()

template<typename NodeIndexType = int32_t, typename ArcIndexType = int32_t>
void util::ReverseArcListGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator::Next ( )
inline

Definition at line 1621 of file graph.h.

◆ Ok()

template<typename NodeIndexType = int32_t, typename ArcIndexType = int32_t>
bool util::ReverseArcListGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator::Ok ( ) const
inline

Definition at line 1619 of file graph.h.

Member Data Documentation

◆ graph_

template<typename NodeIndexType = int32_t, typename ArcIndexType = int32_t>
const ReverseArcListGraph& util::ReverseArcListGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator::graph_
protected

Definition at line 1629 of file graph.h.

◆ index_

template<typename NodeIndexType = int32_t, typename ArcIndexType = int32_t>
ArcIndexType util::ReverseArcListGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator::index_
protected

Definition at line 1630 of file graph.h.

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