/usr/include/tulip/MapIterator.h is in libtulip-dev 4.4.0dfsg2-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 | /*
*
* This file is part of Tulip (www.tulip-software.org)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux 1 and Inria Bordeaux - Sud Ouest
*
* Tulip is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation, either version 3
* of the License, or (at your option) any later version.
*
* Tulip is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
* See the GNU General Public License for more details.
*
*/
///@cond DOXYGEN_HIDDEN
#include <tulip/Iterator.h>
#include <tulip/tulipconf.h>
#include <tulip/Edge.h>
#include <list>
#include <vector>
#ifndef DOXYGEN_NOTFOR_DEVEL
#ifndef TULIP_NODEMAPITERATOR_H
#define TULIP_NODEMAPITERATOR_H
namespace tlp {
struct node;
class Graph;
/**
* That function enables to obtain the next edge on a face of the embedding. It uses
* the EdgeMapIterators.
*
* @see NodeMapIterator
* @see EdgeMapIterator
* @see PlanarConMap
*/
TLP_SCOPE edge nextFaceEdge(Graph* g, edge source, node target);
/**
* @class NodeMapIterator
* @brief Iterator that enables to traverse the graph taking into account the ordering of edges aroung nodes
* @param sg the considered graph
* @param source the node from witch one arrives on target
* @param target the node the considered node (one will obtain an iterator on the neighboors of that node)
*
* Since Tulip enables to order the edges around nodes, it is possible to traverse the nodes according
* to that ordering. It is necessary to use that function if one wants to take into account the embedding
* of the graph. Such functionnality is really useful when dealing with planar graphs. However if one wants
* more efficient data structure for planar graphs one should consider using PlanarConMap.
*
* @see EdgeMapIterator
* @see PlanarConMap
*/
struct TLP_SCOPE NodeMapIterator : public Iterator<node> {
///
NodeMapIterator(Graph *sg, node source, node target);
~NodeMapIterator();
///Return the next element
node next();
///Return true if it exist a next element
bool hasNext();
private :
std::list<node> cloneIt;
std::list<node>::iterator itStl;
};
/**
* @class EdgeMapIterator
* @brief Iterator that enables to traverse the graph taking into account the ordering of edges aroung nodes
* @param sg the considered graph
* @param source the edge from witch one arrives on target
* @param target the node the considered node (one will obtain an iterator on the neighboors of that node)
*
* Since Tulip enables to order the edges around nodes, it is possible to traverse the nodes according
* to that ordering. It is necessary to use that function if one wants to take into account the embedding
* of the graph. Such functionnality is really useful when dealing with planar graphs. However if one wants
* more efficient data structure for planar graphs one should consider using PlanarConMap.
*
* @see EdgeMapIterator
* @see PlanarConMap
*/
struct TLP_SCOPE EdgeMapIterator : public Iterator<edge> {
///
EdgeMapIterator(const Graph *sg, edge source, node target);
///Return the next element
edge next();
///Return true if it exist a next element
bool hasNext();
private :
std::vector<edge> adj;
edge start;
int treat;
unsigned int pos;
bool finished;
};
}
#endif
#endif //DOXYGEN_NOTFOR_DEVEL
///@endcond
|