////////////////////////////////////////////////////////////////////////////////
//
//  File:  Graph.cpp
//
//  For more information, please see: http://www.nektar.info/
//
//  The MIT License
//
//  Copyright (c) 2006 Division of Applied Mathematics, Brown University (USA),
//  Department of Aeronautics, Imperial College London (UK), and Scientific 
//  Computing and Imaging Institute, University of Utah (USA).
//
//  License for the specific language governing rights and limitations under
//  Permission is hereby granted, free of charge, to any person obtaining a
//  copy of this software and associated documentation files (the "Software"),
//  to deal in the Software without restriction, including without limitation
//  the rights to use, copy, modify, merge, publish, distribute, sublicense,
//  and/or sell copies of the Software, and to permit persons to whom the
//  Software is furnished to do so, subject to the following conditions:
//
//  The above copyright notice and this permission notice shall be included
//  in all copies or substantial portions of the Software.
//
//  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
//  OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
//  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
//  THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
//  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
//  FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
//  DEALINGS IN THE SOFTWARE.
//
//  Description:  
//
//
////////////////////////////////////////////////////////////////////////////////

#include <LibUtilities/Foundations/Graph.h>

namespace Nektar
{
    namespace LibUtilities
    {

        int GraphVertexObject::m_nextid = 0;

        GraphVertexObject::~GraphVertexObject()
        {
        }

        Graph::Graph()
        {
        }

        Graph::~Graph()
        {
#if 0       
            std::list<GraphVertexObject *>::const_iterator def; 
            for(def = m_vertset.begin(); def != m_vertset.end(); ++def)
            {
                delete  *def;
            }

            std::list<GraphEdgeObject *>::const_iterator def1; 
            for(def1 = _Edgeset.begin(); def1 != _Edgeset.end(); ++def1)
            {
                delete  *def1;
            }
#endif    
        }

        bool operator  == (const GraphVertexObject &x, const GraphVertexObject &y)
        {
            return (x.m_id == y.m_id);
        }

        bool operator != (const GraphVertexObject &x, const GraphVertexObject &y)
        {
            return (x.m_id != y.m_id);
        }
    } // end of namespace 
} // end of namespace 

