Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <ebert_graph.h>
Public Member Functions | |
OutgoingOrOppositeIncomingArcIterator (const EbertGraph &graph, NodeIndexType node) | |
OutgoingOrOppositeIncomingArcIterator (const EbertGraph &graph, NodeIndexType node, ArcIndexType arc) | |
void | operator= (const OutgoingOrOppositeIncomingArcIterator &iterator) |
Can only assign from an iterator on the same graph. | |
bool | Ok () const |
Returns true unless all the adjancent arcs have been traversed. | |
void | Next () |
Advances the current adjacent arc index. | |
ArcIndexType | Index () const |
Returns the index of the arc currently pointed to by the iterator. | |
Iterator class for traversing the arcs incident to a given node in the graph.
Definition at line 1242 of file ebert_graph.h.
|
inline |
Definition at line 1244 of file ebert_graph.h.
|
inline |
This constructor takes an arc as extra argument and makes the iterator start at arc.
Definition at line 1255 of file ebert_graph.h.
|
inline |
Returns the index of the arc currently pointed to by the iterator.
Definition at line 1280 of file ebert_graph.h.
|
inline |
Advances the current adjacent arc index.
Definition at line 1274 of file ebert_graph.h.
|
inline |
Returns true unless all the adjancent arcs have been traversed.
Definition at line 1271 of file ebert_graph.h.
|
inline |
Can only assign from an iterator on the same graph.
Definition at line 1264 of file ebert_graph.h.