dijkstra.cpp File Reference

#include <bits/stdc++.h>

Classes
class	dijkstra_sssp< graph >
struct	edge_t

Functions
int	main ()

Function Documentation

int main

(

)

           {
    
    int t;
    cin >> t;
    while(t--) {
        undirected_graph<long long, edge_t> g;
        long long n, m, u, v, wt;
        cin >> n >> m;
        while(m--) {
            cin >> u >> v >> wt;
            edge_t e(u, v, wt);
            g.add_edge(e);
        }
    
        cin >> n >> m;
        dijkstra_sssp<undirected_graph<long long, edge_t>> shpath(g, n);
        long long len = shpath.dist_to(m);
        if(len != -1)
            cout << len << endl;
        else
            cout << "NO" << endl;
    }
}