Dijkstra Algorithm with SNAP Library

dijkstra.cpp

#include "Snap.h"

int main(int argc, char* argv[]) {
    TFIn FIn(argv[1]);
    PNEANet Graph = TNEANet::Load(FIn);
    printf("Load Graph\n");

    TIntFltH NDistH(Graph->GetNodes());
    TFltV vec ;
    int out = TSnap::GetWeightedShortestPath(Graph, 0, NDistH, vec);
    printf("%d\n", out);
    printf("Dijkstra ended\n");
}