/home/marcvs/Desktop/working/pa-materiale/pa/codeBase/C++/include/GraphEdgeList.h

#ifndef __GRAPHEDGELIST_H__
#define __GRAPHEDGELIST_H__

#pragma once

#include <iostream>
#include <fstream>
#include <vector>

class GraphEdgeList;

std::ostream& operator<< (std::ostream& out, const GraphEdgeList & graph);

std::istream& operator>> (std::istream& out, const GraphEdgeList & graph);

class GraphEdgeList {

private:
        unsigned int n;

        std::vector< std::vector<std::pair<int,int> > > neighbours;

        std::vector< std::pair< std::pair<int,int>, int> > edgeList;

public: 
        inline GraphEdgeList(unsigned int n) :
                n(n)
        {
                neighbours.resize(n);
        }
        
        inline unsigned int get_n() const {
                return n;
        }
        
        inline std::vector< std::pair<int,int> > & get_neighbours(int nod) {
                return neighbours[nod];
        }
        
        inline std::vector< std::pair< std::pair<int,int>, int> > get_edges() {
                return edgeList;
        }

        friend std::ostream& operator<< (std::ostream& out, GraphEdgeList & graph);
        friend std::istream& operator>> (std::istream& in, GraphEdgeList & graph);
};

#endif