MCPcopy Create free account
hub / github.com/codemistic/Data-Structures-and-Algorithms / main

Function main

graph/code17.cpp:56–72  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

54}
55
56int main()
57{
58 int v = 4;
59 vector<pair<int, int>> adj[v];
60
61 // adding edges now
62 add_edge(adj, 0, 1, 1);
63 add_edge(adj, 0, 2, 4);
64 add_edge(adj, 1, 2, -3);
65 add_edge(adj, 1, 3, 2);
66 add_edge(adj, 2, 3, 3);
67
68 int source = 0;
69 bellman_ford(adj, v, source);
70
71 return 0;
72}

Callers

nothing calls this directly

Calls 2

bellman_fordFunction · 0.85
add_edgeFunction · 0.70

Tested by

no test coverage detected