graph.cpp

Go to the documentation of this file.

// -*- c-basic-offset: 4 -*-

#include "graph.h"


using namespace hugin_utils;


void hugin_utils::findSubGraphs(AdjListGraph & graph,
                          std::vector<int> & subgraphStart)
{
    int nImages = (int) graph.size();
    // nodes that have not been visited
    std::set<int> unseen;
    // fill with all images
    for (int i=0; i<nImages; i++) unseen.insert(i);

    while(unseen.size() != 0 ) {
        // first remaining node determines the next graph
        int root = (int) *(unseen.begin());
        subgraphStart.push_back(root);
        // visit all nodes of this subgraph
        RemoveVisitor rmv(unseen);
        traverseVertices(graph, root, rmv);
    }
}

---