Graph.h

Go to the documentation of this file.

// MIT License
//
// Copyright (c) 2019 Ian Parberry
//
// 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.

#include "Includes.h"
#include "Random.h"

#ifndef __Graph__
#define __Graph__

class CVertex; //forward declaration


class CEdge{
  protected:
    CVertex* m_pVertex0 = nullptr; 
    CVertex* m_pVertex1 = nullptr; 

    UINT m_nIndex = 0; 
    bool m_bMarked = false; 

  public:
    CEdge(CVertex* p0, CVertex* p1, UINT index); 

    CVertex* GetNextVertex(CVertex* p); 

    UINT GetIndex(); 

    void Mark(bool b=true); 
    bool Marked(); 

    void GetVertexIndices(UINT& i0, UINT& i1); 
}; //CEdge



class CVertex{
  private:
    std::vector<CEdge*> m_vAdjacencyList; 

    UINT m_nIndex = 0; 
    bool m_bMarked = false; 

  public:
    CVertex(); 

    void InsertAdjacency(CEdge* pEdge); 

    void SetIndex(const UINT n); 
    UINT GetIndex(); 

    void Mark(bool b=true); 
    bool Marked(); 

    std::vector<CEdge*>* GetAdjacencyList(); 
    size_t GetDegree(); 
}; //CVertex



class CGraph{
  protected:
    std::vector<CEdge*> m_vEdgeList; 
    UINT m_nNumEdges = 0; 

    CVertex* m_pVertexList = nullptr; 
    UINT m_nNumVerts = 0; 

    std::queue<CVertex*> m_qBFSQueue; 

    CRandom m_cRandom; 
    
  public:
    CGraph(const UINT n); 
    ~CGraph(); 

    void InsertEdge(const UINT i, const UINT j); 
    UINT BFSF(std::vector<UINT>& result); 

    void PrintGraph(); 
}; //CGraph

#endif