Implementing the k-shortest paths problem

Question

I have implemented a directed weighted graph using map.

struct Edge
{
    int destination;
    int weight;
    Edge(int, int);
};

private:
    int number;
    st