std::set<Crag::Node>
collectLeafNodes(const Crag& crag, Crag::Node n) {
std::set<Crag::Node> leafNodes;
if (crag.isLeafNode(n)) {
leafNodes.insert(n);
} else {
for (Crag::SubsetInArcIt e(crag, crag.toSubset(n)); e != lemon::INVALID; ++e) {
Crag::Node child = crag.toRag(crag.getSubsetGraph().source(e));
std::set<Crag::Node> leafs = collectLeafNodes(crag, child);
for (Crag::Node l : leafs)
leafNodes.insert(l);
}
}
return leafNodes;
}
void crag_iterators() {
Crag crag;
int numNodes = 10;
for (int i = 0; i < numNodes; i++)
crag.addNode();
int numEdges = 0;
for (int i = 0; i < numNodes; i++)
for (int j = 0; j < numNodes; j++)
if (rand() > RAND_MAX/2) {
crag.addAdjacencyEdge(
crag.nodeFromId(i),
crag.nodeFromId(j));
numEdges++;
}
int numArcs = 0;
for (int i = 0; i < numNodes; i += 5) {
for (int j = i; j < i + 4; j++) {
crag.addSubsetArc(
crag.nodeFromId(j),
crag.nodeFromId(j+1));
numArcs++;
}
}
BOOST_CHECK_EQUAL(crag.nodes().size(), numNodes);
BOOST_CHECK_EQUAL(crag.edges().size(), numEdges);
BOOST_CHECK_EQUAL(crag.arcs().size(), numArcs);
numNodes = 0;
{
//UTIL_TIME_SCOPE("crag node old-school iterator");
//for (int j = 0; j < 1e8; j++)
for (Crag::CragNodeIterator i = crag.nodes().begin(); i != crag.nodes().end(); i++)
numNodes++;
}
{
//UTIL_TIME_SCOPE("crag node iterator");
//for (int j = 0; j < 1e8; j++)
for (Crag::CragNode n : crag.nodes()) {
dontWarnMeAboutUnusedVar(n);
numNodes++;
}
}
{
//UTIL_TIME_SCOPE("lemon node iterator");
//for (int j = 0; j < 1e8; j++)
for (Crag::NodeIt n(crag); n != lemon::INVALID; ++n)
numNodes -= 2;
}
BOOST_CHECK_EQUAL(numNodes, 0);
numEdges = 0;
for (Crag::CragEdge e : crag.edges()) {
dontWarnMeAboutUnusedVar(e);
numEdges++;
}
for (Crag::EdgeIt e(crag); e != lemon::INVALID; ++e)
numEdges--;
BOOST_CHECK_EQUAL(numEdges, 0);
numArcs = 0;
for (Crag::CragArc a : crag.arcs()) {
dontWarnMeAboutUnusedVar(a);
numArcs++;
}
for (Crag::SubsetArcIt a(crag); a != lemon::INVALID; ++a)
numArcs--;
BOOST_CHECK_EQUAL(numArcs, 0);
for (Crag::CragNode n : crag.nodes()) {
int numAdjEdges = 0;
for (Crag::IncEdgeIt e(crag, n); e != lemon::INVALID; ++e)
numAdjEdges++;
BOOST_CHECK_EQUAL(crag.adjEdges(n).size(), numAdjEdges);
for (Crag::CragEdge e : crag.adjEdges(n)) {
dontWarnMeAboutUnusedVar(e);
numAdjEdges--;
}
BOOST_CHECK_EQUAL(numAdjEdges, 0);
int numInArcs = 0;
for (Crag::SubsetInArcIt a(crag, crag.toSubset(n)); a != lemon::INVALID; ++a)
numInArcs++;
BOOST_CHECK_EQUAL(numInArcs, crag.inArcs(n).size());
for (Crag::CragArc a : crag.inArcs(n)) {
dontWarnMeAboutUnusedVar(a);
numInArcs--;
}
BOOST_CHECK_EQUAL(numInArcs, 0);
int numOutArcs = 0;
for (Crag::SubsetOutArcIt a(crag, crag.toSubset(n)); a != lemon::INVALID; ++a)
numOutArcs++;
BOOST_CHECK_EQUAL(numOutArcs, crag.outArcs(n).size());
for (Crag::CragArc a : crag.outArcs(n)) {
dontWarnMeAboutUnusedVar(a);
numOutArcs--;
}
BOOST_CHECK_EQUAL(numOutArcs, 0);
Crag::CragEdgeIterator cei = crag.edges().begin();
Crag::EdgeIt ei(crag);
while (ei != lemon::INVALID) {
BOOST_CHECK((Crag::RagType::Node)((*cei).u()) == crag.getAdjacencyGraph().u(ei));
BOOST_CHECK((Crag::RagType::Node)((*cei).v()) == crag.getAdjacencyGraph().v(ei));
++cei;
++ei;
}
Crag::CragArcIterator cai = crag.arcs().begin();
Crag::SubsetArcIt ai(crag);
while (ai != lemon::INVALID) {
BOOST_CHECK(crag.toSubset((*cai).source()) == crag.getSubsetGraph().source(ai));
BOOST_CHECK(crag.toSubset((*cai).target()) == crag.getSubsetGraph().target(ai));
++cai;
++ai;
}
}
}
