hypergraphlib_arc.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_arc.cpp
//####//
//####//------------------------------------------------------------
//####//------------------------------------------------------------
//####//    COPYRIGHT 2000-2024
//####//  jeu 13 jun 2024 11:54:00 EDT
//####//------------------------------------------------------------
//####//------------------------------------------------------------
#include <iostream>
 
#pragma hdrstop
 
#include "hypergraphlib_platform.h"
#include "hypergraphlib_arc.h"
#include "hypergraphlib_graph.h"
#include "hypergraphlib_node.h"
 
 
namespace HypergraphLib {
 
Arc::Arc(Graph * __owner, int __id)
        : GraphObject (__owner, __id)
{
}
 
Arc::Arc(const Arc &__from, Graph * __owner)
        : GraphObject(__from, __owner)
{
    for (Arc::MultimapNodesById::const_iterator it = __from._nodes.begin();
            it != __from._nodes.end();
            it++)
    {
        Node * n = _owner->GetNode(it->first);
        if (n)
        {
            Add (n);
        }
    }
}
 
Arc::~Arc()
{
 
}
 
void Arc::Add (Node * __node)
{
    _nodes.insert ( Int_Node_Pair ( __node->Id(), __node ));
}
 
int Arc::Remove (Node * __node)
{
    return Remove (__node->Id());
}
 
int Arc::Remove (int __id)
{
    int result=0;
    MultimapNodesById::iterator it;
    for (it = _nodes.find ( __id );
            it != _nodes.end();
            it = _nodes.find ( __id ), result++)
        _nodes.erase ( it );
 
    /*while(it!=_nodes.end())
    {
        _nodes.erase ( it );
        it = _nodes.find ( __id );
    }*/
 
    return result;
}
 
int Arc::Rank () const
{
    return _nodes.size();
}
 
int Arc::NodeCount(int __id) const
{
    return _nodes.count(__id);
}
 
Arc::MultimapNodesById & Arc::Nodes()
{
    return _nodes;
}
 
Node * Arc::First() const
{
    MultimapNodesById::const_iterator it = _nodes.begin();
    return it->second;
}
 
Node * Arc::Last() const
{
    MultimapNodesById::const_iterator it = _nodes.end();
    it--;
    return it->second;
}
 
bool Arc::IsLoopOfNode(int __NodeId)
{
    return (NodeCount(__NodeId ) == 2);
}
 
bool Arc::IsLoop()
{
    return (_nodes.size() == 2 && First() == Last() );
}
 
}