21 #include <tulip/Iterator.h> 22 #include <tulip/tulipconf.h> 23 #include <tulip/Edge.h> 27 #ifndef TULIP_NODEMAPITERATOR_H 28 #define TULIP_NODEMAPITERATOR_H 43 TLP_SCOPE edge nextFaceEdge(Graph *g, edge source, node target);
65 struct TLP_SCOPE NodeMapIterator :
public Iterator<node> {
67 NodeMapIterator(Graph *sg, node source, node target);
68 ~NodeMapIterator()
override;
72 bool hasNext()
override;
75 std::list<node> cloneIt;
76 std::list<node>::iterator itStl;
99 struct TLP_SCOPE EdgeMapIterator :
public Iterator<edge> {
101 EdgeMapIterator(
const Graph *sg, edge source, node target);
103 edge next()
override;
105 bool hasNext()
override;
108 std::vector<edge> adj;