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

Function main

graph/code4.cpp:49–68  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

47}
48
49int main()
50{
51 int v;
52 v = 6;
53 vector<int> adj[v];
54
55 // Adding edges from this point
56 add_edge(adj, 0, 1);
57 add_edge(adj, 0, 2);
58 add_edge(adj, 0, 3);
59 add_edge(adj, 1, 5);
60 add_edge(adj, 2, 5);
61 add_edge(adj, 1, 4);
62
63 cout << "Breadth First Search is: " << endl;
64
65 bfs_recursive(adj, v);
66
67 return 0;
68}

Callers

nothing calls this directly

Calls 2

bfs_recursiveFunction · 0.85
add_edgeFunction · 0.70

Tested by

no test coverage detected