hypergraphlib_components.cpp

Aller à la documentation de ce fichier.

//####//------------------------------------------------------------
//####//------------------------------------------------------------
//####//  MAGiC
//####//  Jean Christophe Cuilliere et Vincent FRANCOIS
//####//  Departement de Genie Mecanique - UQTR
//####//------------------------------------------------------------
//####//  MAGIC est un projet de recherche de l equipe ERICCA
//####//  du departement de genie mecanique de l Universite du Quebec a Trois Rivieres
//####//  http://www.uqtr.ca/ericca
//####//  http://www.uqtr.ca/
//####//------------------------------------------------------------
//####//------------------------------------------------------------
//####//
//####//       hypergraphlib_components.cpp
//####//
//####//------------------------------------------------------------
//####//------------------------------------------------------------
//####//    COPYRIGHT 2000-2024
//####//  jeu 13 jun 2024 11:54:00 EDT
//####//------------------------------------------------------------
//####//------------------------------------------------------------
#include "hypergraphlib_platform.h"
 
#include "hypergraphlib_components.h"
#include "hypergraphlib_dfs.h"
#include "hypergraphlib_graph.h"
#include "hypergraphlib_node.h"
 
namespace HypergraphLib {
 
void FindSCC(Graph * __G, std::set < std::set < Node * > > & __components)
{
    std::map < int, Node * > unvisitedNodes = __G->GetNodes();
 
    while (unvisitedNodes.size())
    {
        std::set < Node * > depthFirstSearchNodes;
        dfs((unvisitedNodes.begin())->second, depthFirstSearchNodes);
        __components.insert ( depthFirstSearchNodes );
        for ( std::set < Node * >::const_iterator it  = depthFirstSearchNodes.begin();
                it != depthFirstSearchNodes.end();
                it++)
            unvisitedNodes.erase((*it)->Id());
    }
}
 
}