i im in search for a c++ code to find ALL possible paths from source to destination in Indianet network.
The node information is given below. 0(1,2) means 0th node is connected to 1 and 2. 

0(1,2)
1(0,3)
2(0,3,4)
3(1,2,6,5)
4(2,6,10)
5(3,6,7)
6(3,4,9,5)
7(5,9,8)
8(7,12,11)
9(6,14,13,12,7)
10(4,14,15)
11(8,12,16)
12(9,13,16,11,8)
13(9,12,17)
14(10,15,19,18,9)
15(10,14,19)
16(11,12,17)
17(16,13,18)
18(17,14,19)
19(18,14,15)

plz help me out
i im in search for a c++ code to find ALL possible paths from source to destination in Indianet network.
===

The node information is given below. 0(1,2) means 0th node is connected to 1 and 2. 

0(1,2)
1(0,3)
2(0,3,4)
3(1,2,6,5)
4(2,6,10)
5(3,6,7)
6(3,4,9,5)
7(5,9,8)
8(7,12,11)
9(6,14,13,12,7)
10(4,14,15)
11(8,12,16)
12(9,13,16,11,8)
13(9,12,17)
14(10,15,19,18,9)
15(10,14,19)
16(11,12,17)
17(16,13,18)
18(17,14,19)
19(18,14,15)

plz help me out