hypergraphlib_node.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_node.cpp
//####//
//####//------------------------------------------------------------
//####//------------------------------------------------------------
//####//    COPYRIGHT 2000-2024
//####//  jeu 13 jun 2024 11:54:00 EDT
//####//------------------------------------------------------------
//####//------------------------------------------------------------
#include <iostream>
 
#pragma hdrstop
 
#include "hypergraphlib_platform.h"
 
#include "hypergraphlib_node.h"
#include "hypergraphlib_arc.h"
 
 
namespace HypergraphLib {
 
Node::Node (Graph * __owner, int __id)
        : GraphObject(__owner, __id)
{
 
}
 
Node::Node (const Node & __from, const Graph * __owner)
        : GraphObject (__from, __owner)
{
}
 
void Node::Add (Arc *__incidentArc)
{
    _arcs.insert( IntArc_Pair(__incidentArc->Id(), __incidentArc) );
}
 
int Node::Remove (int __id)
{
    int result=0;
    MultimapArcsById::iterator it = _arcs.find ( __id );
    result = (it != _arcs.end());
    if (result)
    {
        _arcs.erase ( it );
    }
    else
    {
        std::cout << "Error: Graph::RemoveArc ( "<<__id<<" )"<<std::endl;
        std::cout << "\t the arc was not found !\n"<<__id<<" )"<<std::endl;
    }
    return result;
}
 
unsigned int Node::ArcCount (int __id)
{
    return _arcs.count ( __id );
}
 
 
void Node::AdjacentNodes ( std::set < int > & __adjacentNodes )
{
    for ( MultimapArcsById::const_iterator itArcs = _arcs.begin();
            itArcs != _arcs.end();
            itArcs++ )
    {
        Arc * arc = itArcs->second;
        for (Arc::MultimapNodesById::const_iterator itNodes = arc->Nodes().begin();
                itNodes != arc->Nodes().end();
                itNodes++)
        {
            int id = itNodes->first;
 
            if ( id != _id && __adjacentNodes.find(id) == __adjacentNodes.end() )
                __adjacentNodes.insert(id);
        }
    }
}
 
void Node::AdjacentNodes ( std::set < Node * > & __adjacentNodes )
{
    for ( MultimapArcsById::const_iterator itArcs = _arcs.begin();
            itArcs != _arcs.end();
            itArcs++ )
    {
        Arc * arc = itArcs->second;
        for (Arc::MultimapNodesById::const_iterator itNodes = arc->Nodes().begin();
                itNodes != arc->Nodes().end();
                itNodes++)
        {
            int id = itNodes->first;
 
            if ( id != _id && __adjacentNodes.find(itNodes->second) == __adjacentNodes.end() )
                __adjacentNodes.insert(itNodes->second);
        }
    }
}
 
 
Arc *
Node::IsAdjacentToNode ( Node * __n )
{
    return IsAdjacentToNode(__n->Id());
}
 
Arc *
Node::IsAdjacentToNode ( int __nodeId )
{
    for ( MultimapArcsById::const_iterator itArcs = _arcs.begin();
            itArcs != _arcs.end();
            itArcs++ )
    {
        Arc * arc = itArcs->second;
 
        if (arc->Nodes().find(__nodeId ) != arc->Nodes().end())
            return arc;
    }
    return 0;
}
 
int
Node::GetNbArcsToNode(Node * __other)
{
    int result = 0;
    int __nodeId = __other->Id();
    for ( MultimapArcsById::const_iterator itArcs = _arcs.begin();
            itArcs != _arcs.end();
            itArcs++ )
    {
        Arc * arc = itArcs->second;
 
        if (arc->Nodes().find(__nodeId ) != arc->Nodes().end())
            result++;
    }
    return result;
}
 
} // end namespace HypergraphLib