Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
Iterator class for traversing the incoming arcs associated to a given node. More...
#include <ebert_graph.h>
Public Member Functions | |
IncomingArcIterator (const EbertGraph &graph, NodeIndexType node) | |
IncomingArcIterator (const EbertGraph &graph, NodeIndexType node, ArcIndexType arc) | |
void | operator= (const IncomingArcIterator &iterator) |
Can only assign from an iterator on the same graph. | |
bool | Ok () const |
Returns true unless all the incoming arcs have been traversed. | |
void | Next () |
Advances the current incoming arc index. | |
ArcIndexType | Index () const |
Returns the index of the arc currently pointed to by the iterator. | |
Iterator class for traversing the incoming arcs associated to a given node.
Definition at line 1303 of file ebert_graph.h.
|
inline |
Definition at line 1305 of file ebert_graph.h.
|
inline |
This constructor takes an arc as extra argument and makes the iterator start at arc.
Definition at line 1314 of file ebert_graph.h.
|
inline |
Returns the index of the arc currently pointed to by the iterator.
Definition at line 1340 of file ebert_graph.h.
|
inline |
Advances the current incoming arc index.
Definition at line 1334 of file ebert_graph.h.
|
inline |
Returns true unless all the incoming arcs have been traversed.
Definition at line 1331 of file ebert_graph.h.
|
inline |
Can only assign from an iterator on the same graph.
Definition at line 1324 of file ebert_graph.h.