src/la/laNode.cpp

   1 /*
   2 Qanava - Graph drawing library for QT
   3 Copyright (C) 2005 Benoit AUTHEMAN
   4
   5 This program is free software; you can redistribute it and/or
   6 modify it under the terms of the GNU General Public License
   7 as published by the Free Software Foundation; either version 2
   8 of the License, or (at your option) any later version.
   9
  10 This program is distributed in the hope that it will be useful,
  11 but WITHOUT ANY WARRANTY; without even the implied warranty of
  12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  13 GNU General Public License for more details.
  14
  15 You should have received a copy of the GNU General Public License
  16 along with this program; if not, write to the Free Software
  17 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
  18 */
  19
  20 //-----------------------------------------------------------------------------
  21 // This file is a part of the Qanava software.
  22 //
  23 // \file        laNode.cpp
  24 // \author      Benoit Autheman (authem_b@epita.fr)
  25 // \date        2004 February 15
  26 //-----------------------------------------------------------------------------
  27
  28
  29 // Qanava headers
  30 #include "laNode.h"
  31 #include "laGraph.h"
  32
  33
  34 // Std headers
  35 #include <algorithm>
  36 #include <iterator>
  37
  38
  39 // Boost headers
  40 #ifndef DOXYSKIP
  41 #include "boost/date_time/posix_time/posix_time.hpp"
  42 #endif
  43
  44
  45 namespace qan { // ::qan
  46 namespace la { // ::qan::la
  47
  48
  49 /* Node Constructor/Destructor *///--------------------------------------------
  50 Node::Node( const std::string& label ) :
  51         _id( 0 ),
  52         _label( label ),
  53         _type( -1 ),
  54         _position( 2 ),
  55         _dimension( 2 ),
  56         _date( 0 )
  57 {
  58         setPosition( -1.f, -1.f );
  59         setDimension( -1.f, -1.f );
  60 }
  61
  62 Node::Node( const std::string& label, int type ) :
  63         _id( 0 ),
  64         _label( label ),
  65         _type( type ),
  66         _position( 2 ),
  67         _dimension( 2 ),
  68         _date( 0 )
  69 {
  70         setPosition( -1.f, -1.f );
  71         setDimension( -1.f, -1.f );
  72 }
  73 //-----------------------------------------------------------------------------
  74
  75
  76
  77 /* Node Edges Management *///--------------------------------------------------
  78 const Node::Nodes&      Node::getOutNodes( ) const
  79 {
  80         return *new Nodes( );
  81 }
  82
  83 Node::NodesSet*         Node::getOutNodesSet( )
  84 {
  85         NodesSet* outNodeSet = new NodesSet( );
  86
  87         // Add all edge destination to the out nodes set
  88         Edge::Edges& edges = getOutEdges( );
  89         Edge::Edges::iterator edgeIter = edges.begin( );
  90         for ( ; edgeIter != edges.end( ); edgeIter++ )
  91         {
  92                 Edge* edge = *edgeIter;
  93                 outNodeSet->insert( &( edge->getDst( ) ) );
  94         }
  95
  96         return outNodeSet;
  97 }
  98
  99 Node::NodesSet*         Node::getInNodesSet( )
 100 {
 101         NodesSet* inNodeSet = new NodesSet( );
 102
 103         // Add all edge destination to the out nodes set
 104         Edge::Edges& edges = getInEdges( );
 105         Edge::Edges::iterator edgeIter = edges.begin( );
 106         for ( ; edgeIter != edges.end( ); edgeIter++ )
 107         {
 108                 Edge* edge = *edgeIter;
 109                 inNodeSet->insert( &( edge->getSrc( ) ) );
 110         }
 111
 112         return inNodeSet;
 113 }
 114
 115 Node::NodesSet* Node::getAdjacentNodesSet( )
 116 {
 117         NodesSet* outNodes = getOutNodesSet( );
 118         NodesSet* inNodes = getInNodesSet( );
 119
 120         NodesSet& adjacentNodes = *new NodesSet( );
 121         std::set_union( outNodes->begin( ), outNodes->end( ),
 122                                         inNodes->begin( ), inNodes->end( ),
 123                                         std::insert_iterator< NodesSet >( adjacentNodes, adjacentNodes.begin( ) ) );
 124
 125         delete outNodes;
 126         delete inNodes;
 127
 128         return &adjacentNodes;
 129 }
 130
 131 Node::NodesSet* Node::getNonAdjacentNodesSet( la::Graph& graph )
 132 {
 133         NodesSet* adjacentNodes = getAdjacentNodesSet( );
 134         NodesSet* graphNodes = graph.getNodesSet( );
 135
 136         NodesSet& nonAdjacentNodes = *new NodesSet( );
 137         std::set_difference( graphNodes->begin( ), graphNodes->end( ),
 138                                                  adjacentNodes->begin( ), adjacentNodes->end( ),
 139                                                  std::insert_iterator< NodesSet >( nonAdjacentNodes, nonAdjacentNodes.begin( ) ) );
 140
 141         // Remove the node idself from to non adjacent nodes list
 142         nonAdjacentNodes.erase( this );
 143
 144         delete adjacentNodes;
 145         delete graphNodes;
 146
 147         return &nonAdjacentNodes;
 148 }
 149 //-----------------------------------------------------------------------------
 150
 151
 152
 153 /* Node Attributes Management *///---------------------------------------------
 154 void    Node::setDate( const std::string& date )
 155 {
 156         try
 157         {
 158                 _date = new boost::posix_time::ptime( boost::posix_time::time_from_string( date ) );
 159         } catch( std::exception& e )
 160         {
 161                 if ( _date != 0 )
 162                         delete _date;
 163                 _date = 0;
 164         }
 165 }
 166 //-----------------------------------------------------------------------------
 167
 168
 169 } // ::qan::la
 170 } // ::qan
 171