you can just write it yourself.
class Node {
public:
    vector<pair<Node*, int>> neighbors; 
    Node* prev; 
    int distance; 

    void addNeighbor(Node* neighbor, int weight) {
        neighbors.push_back(make_pair(neighbor, weight));
    }
};
 the node class would look something like this

and while updating the path, make sure you make the right connections and your usual Dijkstra algorithm.