Dijikstra C++ programming

Complete the function:

Here is the link: https://hastebin.com/inisepoxop.cpp

Output should be like this:

Dijkstra bidirectional graph g (starting from 0) Picked Node: 0 4 31 2 w/Distance: (0,0) (4,5) (3,7) (1,8) (2,9) Distance Array: (0,0) (1,8) (2,9) (3,7) (4,5) Adjacency List for the g Graph Graph of (5, 10) Vertex-0 with: 0-(1, 10) 0->(4, 5) Vertex-1 with: 1->(2, 9) Vertex-2 with: Vertex-3 with: 3->(2, 13) Vertex-4 with: 4->(1, 8) 4-(2, 14) 4->(3, 7) Dijkstra bidirectional graph G2B (starting from 2) Picked Node: 28 56 3710 4 w/Distance: (2,0) (8,2) (5,4) (6,6) (3,7) (7,7) (1,8) (0,12) (4,14) Distance Array: (0,12) (1,8) (2,0) (3,7) (4,14) (5,4) (6,6) (7,7) (8,2) Adjacency List for the G2B Graph Graph of (9, 28) Vertex-0 with: Vertex-1 with: 1->(0, 12) Vertex-2 with: 2->(1, 8) 2-(3, 7) 2->(5, 4) 2->(8, 2) Vertex-3 with: Vertex-4 with Vertex-5 with: 5->(4, 14) 5->(6, 6) Vertex-6 with: 6->(7, 7) Vertex-7 with: 7->(0, 15) Vertex-8 with: 8->(6, 8) 8-(7, 9) Dijkstra bidirectional graph G3B (starting from 2) Picked Node: 2 130 4 5 w/Distance: (2,0) (1,2) (3,2) (0,3) (4,3) (5,5) Distance Array: (0,3) (1,2) (2,0) (3,2) (4,3) (5,5) Adjacency List for the G3B Graph Graph of (6, 18) Vertex-0 with: Vertex-1 with: Vertex-2 with: 2->(0, 3) 2-(1, 2) 2->(3, 2) 2->(4, 3) Vertex-3 with: 3->(5, 8) Vertex-4 with: 4->(5, 5) Vertex-5 with: Dijkstra bidirectional graph g (starting from 0) Picked Node: 0 4 31 2 w/Distance: (0,0) (4,5) (3,7) (1,8) (2,9) Distance Array: (0,0) (1,8) (2,9) (3,7) (4,5) Adjacency List for the g Graph Graph of (5, 10) Vertex-0 with: 0-(1, 10) 0->(4, 5) Vertex-1 with: 1->(2, 9) Vertex-2 with: Vertex-3 with: 3->(2, 13) Vertex-4 with: 4->(1, 8) 4-(2, 14) 4->(3, 7) Dijkstra bidirectional graph G2B (starting from 2) Picked Node: 28 56 3710 4 w/Distance: (2,0) (8,2) (5,4) (6,6) (3,7) (7,7) (1,8) (0,12) (4,14) Distance Array: (0,12) (1,8) (2,0) (3,7) (4,14) (5,4) (6,6) (7,7) (8,2) Adjacency List for the G2B Graph Graph of (9, 28) Vertex-0 with: Vertex-1 with: 1->(0, 12) Vertex-2 with: 2->(1, 8) 2-(3, 7) 2->(5, 4) 2->(8, 2) Vertex-3 with: Vertex-4 with Vertex-5 with: 5->(4, 14) 5->(6, 6) Vertex-6 with: 6->(7, 7) Vertex-7 with: 7->(0, 15) Vertex-8 with: 8->(6, 8) 8-(7, 9) Dijkstra bidirectional graph G3B (starting from 2) Picked Node: 2 130 4 5 w/Distance: (2,0) (1,2) (3,2) (0,3) (4,3) (5,5) Distance Array: (0,3) (1,2) (2,0) (3,2) (4,3) (5,5) Adjacency List for the G3B Graph Graph of (6, 18) Vertex-0 with: Vertex-1 with: Vertex-2 with: 2->(0, 3) 2-(1, 2) 2->(3, 2) 2->(4, 3) Vertex-3 with: 3->(5, 8) Vertex-4 with: 4->(5, 5) Vertex-5 with