• Implement Floyd Warshall algorithm in a weighted directed graph to find all pair shortest paths.(show the output of them as a matrix)
• Print the all pair shortest paths.(You have to print the paths from all the nodes to other all nodes

Use C/C++ Programming Language

For taking input of the graph use following code in you solve

struct node { int nd, weight ; } temp; vector g[100] ;

scanf("%d %d", &n, &edge) ; for(i = 0 ; i < edge ; i++) { scanf("%d %d %d", &u, &v, &w) ; temp.nd = v ; temp.weight = w ; g[u].push_back(temp) ; temp.nd = u ; g[v].push_back(temp) ; }

Show necessary output