ALGraph.h

//---------------------------------------------------------------------------
#ifndef ALGRAPH_H
#define ALGRAPH_H
//---------------------------------------------------------------------------
#include <vector>

struct DijkstraInfo
{
  unsigned cost;
  std::vector<unsigned> path;
};

struct AdjacencyInfo
{
  unsigned id;
  unsigned weight;
};

typedef std::vector<std::vector<AdjacencyInfo> > ALIST;

class ALGraph
{
  public:
    ALGraph(unsigned size);
    ~ALGraph(void);
    void AddDEdge(unsigned source, unsigned destination, unsigned weight);
    void AddUEdge(unsigned node1, unsigned node2, unsigned weight);

    std::vector<DijkstraInfo> Dijkstra(unsigned start_node) const;
    ALIST GetAList(void) const;
        
  private:
    
    // An EXAMPLE of some other classes you may want to create and 
    // implement in ALGraph.cpp
    class GNode; 
    class GEdge;
    struct AdjInfo
    {
        //GNode *node;
        unsigned id; // 1..n
        unsigned weight; 
       
        // helper var for Dijkstra's
        unsigned cost;

        //AdjInfo();

        bool operator<(const AdjInfo& rhs) const {
            return weight < rhs.weight;       
        }

        bool operator>(const AdjInfo& rhs) const {
            return weight > rhs.weight;       
        }
    };

    using ADJLIST = std::vector<std::vector<AdjInfo> >;

    // Other private fields and methods
    unsigned size_;
    ADJLIST alist_;
};

#endif