File: graph_dijkstra.cpp.stdout

package info (click to toggle)
seqan2 2.3.1%2Bdfsg-4
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 222,320 kB
  • ctags: 40,872
  • sloc: cpp: 252,894; ansic: 86,805; python: 6,534; sh: 985; xml: 570; makefile: 236; awk: 51
file content (26 lines) | stat: -rw-r--r-- 582 bytes parent folder | download | duplicates (9)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
Adjacency list:
0 -> 4,3,2,1,
1 -> 3,0,
2 -> 4,0,
3 -> 1,0,
4 -> 2,0,
Edge list:
Source: 0,Target: 4 (Id: 3)
Source: 0,Target: 3 (Id: 2)
Source: 0,Target: 2 (Id: 1)
Source: 0,Target: 1 (Id: 0)
Source: 1,Target: 3 (Id: 5)
Source: 2,Target: 4 (Id: 4)

//![iterate-and-output-properties]
0:Berlin
1:Hamburg
2:Hannover
3:Mainz
4:Munich
//![iterate-and-output-properties]
Shortest path from Hannover to Berlin: 286
Shortest path from Hannover to Hamburg: 575
Shortest path from Hannover to Hannover: 0
Shortest path from Hannover to Mainz: 859
Shortest path from Hannover to Munich: 572