boostDijkstraTest results

boostDijkstraTest.expected

UNDIRECTED GRAPH DEMO
out_edges(0):
out_edges(1): (1,2)=1 (1,2)=2
out_edges(2): (2,1)=1 (2,1)=2 (2,3)=2 (2,5)=1 (2,5)=2
out_edges(3): (3,2)=2 (3,4)=2 (3,6)=1
out_edges(4): (4,3)=2 (4,9)=1 (4,9)=2
out_edges(5): (5,2)=1 (5,2)=2 (5,8)=1 (5,8)=2 (5,6)=1 (5,6)=2 (5,10)=1 (5,10)=2
out_edges(6): (6,3)=1 (6,5)=1 (6,5)=2 (6,9)=1 (6,9)=2 (6,11)=1
out_edges(7): (7,8)=1 (7,8)=2
out_edges(8): (8,7)=1 (8,7)=2 (8,5)=1 (8,5)=2
out_edges(9): (9,6)=1 (9,6)=2 (9,12)=1 (9,12)=2 (9,4)=1 (9,4)=2
out_edges(10): (10,5)=1 (10,5)=2 (10,11)=1 (10,13)=1 (10,13)=2
out_edges(11): (11,6)=1 (11,10)=1 (11,12)=1
out_edges(12): (12,11)=1 (12,9)=1 (12,9)=2
out_edges(13): (13,10)=1 (13,10)=2
out_edges(14): (14,15)=1 (14,15)=2
out_edges(15): (15,14)=1 (15,14)=2
out_edges(16): (16,17)=1 (16,17)=2
out_edges(17): (17,16)=1 (17,16)=2

Number of vertices in the graph18
distance(3)2
distance(2)0
Number of vertices in the graph18
distance(2)2
distance(3)0
DIRECTED GRAPH DEMO
out_edges(0):
out_edges(1): (1,2)=1
out_edges(2): (2,1)=2 (2,5)=1
out_edges(3): (3,2)=2 (3,6)=1
out_edges(4): (4,3)=2 (4,9)=1
out_edges(5): (5,2)=2 (5,8)=2 (5,6)=1 (5,10)=1
out_edges(6): (6,5)=2 (6,9)=1 (6,11)=1
out_edges(7): (7,8)=1
out_edges(8): (8,7)=2 (8,5)=1
out_edges(9): (9,6)=2 (9,12)=1 (9,4)=2
out_edges(10): (10,5)=2 (10,11)=1 (10,13)=1
out_edges(11): (11,12)=1
out_edges(12): (12,9)=2
out_edges(13): (13,10)=2
out_edges(14): (14,15)=1
out_edges(15): (15,14)=2
out_edges(16): (16,17)=1
out_edges(17): (17,16)=2

Number of vertices in the graph18
distance(3)7
distance(4)5
distance(9)3
distance(6)2
distance(5)1
distance(2)0
Number of vertices in the graph18
distance(2)2
distance(3)0
UNDIRECTED ON BOOST::DIRECTED GRAPH DEMO
out_edges(0):
out_edges(1): (1,2)=1 (1,2)=2
out_edges(2): (2,1)=2 (2,1)=1 (2,3)=2 (2,5)=1 (2,5)=2
out_edges(3): (3,2)=2 (3,4)=2 (3,6)=1
out_edges(4): (4,3)=2 (4,9)=1 (4,9)=2
out_edges(5): (5,2)=2 (5,2)=1 (5,8)=2 (5,8)=1 (5,6)=1 (5,6)=2 (5,10)=1 (5,10)=2
out_edges(6): (6,3)=1 (6,5)=2 (6,5)=1 (6,9)=1 (6,9)=2 (6,11)=1
out_edges(7): (7,8)=1 (7,8)=2
out_edges(8): (8,7)=2 (8,7)=1 (8,5)=1 (8,5)=2
out_edges(9): (9,6)=2 (9,6)=1 (9,12)=1 (9,12)=2 (9,4)=2 (9,4)=1
out_edges(10): (10,5)=2 (10,5)=1 (10,11)=1 (10,13)=1 (10,13)=2
out_edges(11): (11,6)=1 (11,10)=1 (11,12)=1
out_edges(12): (12,11)=1 (12,9)=2 (12,9)=1
out_edges(13): (13,10)=2 (13,10)=1
out_edges(14): (14,15)=1 (14,15)=2
out_edges(15): (15,14)=2 (15,14)=1
out_edges(16): (16,17)=1 (16,17)=2
out_edges(17): (17,16)=2 (17,16)=1

Number of vertices in the graph18
distance(3)2
distance(2)0
Number of vertices in the graph18
distance(2)2
distance(3)0