TAPsDirectedGraph.hpp

Go to the documentation of this file.

/******************************************************************************
TAPsDirectedGraph.hpp
******************************************************************************/
/******************************************************************************
SUKITTI PUNAK   (09/12/2005)
UPDATE          (09/09/2010)
******************************************************************************/
#ifndef TAPs_DIRECTED_GRAPH_HPP
#define TAPs_DIRECTED_GRAPH_HPP

#include "TAPsGraphNode.hpp"
#include <vector>

BEGIN_NAMESPACE_TAPs__DS
//=============================================================================
template <typename T>
class DirectedGraph {
//=============================================================================
// Data Members
protected:
    std::vector< GraphNode<T> > m_vNodes;   // a vector of vertices
//=============================================================================
// Member Functions
public:
    typedef T value_type;
    typedef typename GraphNode<T> node;
    typedef typename std::vector<node>::iterator iterator;
    typedef typename std::vector<node>::const_iterator const_iterator;
    //-------------------------------------------------------------------------
    friend std::ostream & operator<< ( std::ostream &output, DirectedGraph<T> const &obj )
    {
        output  << "DirectedGraph<" << typeid(T).name()
            << "> with " << static_cast<int>(obj.m_vNodes.size()) << " nodes:"
            << "\n";
        //output << "Connections:\n";
        //for ( unsigned int i = 0; i < obj.m_vNodes.size(); ++i ) {
        //  output << "  Node#" << i << " with ID " << obj.m_vNodes[i].GetID() << " connects to nodes with IDs ";
        //  for ( unsigned int l = 0; l < obj.m_vNodes[i].GetNumOfLinks(); ++l ) {
        //      output << " " << obj.m_vNodes[i].GetNodeIdOfLinkNumber( l );
        //  }
        //  output << "\n";
        //}
        output << "List of Nodes:\n";
        for ( int i = 0; i < static_cast<int>(obj.m_vNodes.size()); ++i ) {
            output << "  Node#" << i << ": " << obj.m_vNodes[i];
        }
        return output;
    }
    //-------------------------------------------------------------------------
    // Constructors and Destructor
    DirectedGraph ();
    virtual ~DirectedGraph ();
    //-------------------------------------------------------------------------
    // Graph Operations
    void NewGraphNode ( T & t );            // create a graph node

    // using int instead of addresses of nodes because std::vector will move 
    // nodes to new addresses when its size gets expanded.

    inline void SetDirection ( unsigned int n1, unsigned int n2 );      // direct node 1 to node 2

    inline void SetBidirection ( unsigned int n1, unsigned int n2 );    // bidirect node 1 and node 2

    //iterator begin () const;
    //iterator end () const;
    //-------------------------------------------------------------------------
    
    inline unsigned int GetNumOfNodes () const  { return m_vNodes.size(); }

    inline node const & RefNodeNumber ( unsigned int number ) const;
    inline node & RefNodeNumber ( unsigned int number );

    inline value_type const &   RefDataInNodeNumber ( unsigned int number ) const;
    inline value_type &         RefDataInNodeNumber ( unsigned int number );

    //-------------------------------------------------------------------------
#if defined(__gl_h_) || defined(__GL_H__)
public:
    virtual void Draw () const;
protected:
    std::vector< Vector3<float> >   m_ListOfNodePos;    
#endif
    //-------------------------------------------------------------------------
}; // END CLASS DirectedGraph
//=============================================================================
END_NAMESPACE_TAPs__DS
//-----------------------------------------------------------------------------
// Include definition if TAPs_USE_EXPORT is not defined
//#if !defined( TAPs_USE_EXPORT )
    #include "TAPsDirectedGraph.cpp"
//#endif
//-----------------------------------------------------------------------------
#endif
//345678901234567890123456789012345678901234567890123456789012345678901234567890
//--+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8