File: breadth_first_search.cpp.stdout

package info (click to toggle)
seqan2 2.5.2-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 228,748 kB
  • sloc: cpp: 257,602; ansic: 91,967; python: 8,326; sh: 1,056; xml: 570; makefile: 229; awk: 51; javascript: 21
file content (30 lines) | stat: -rw-r--r-- 717 bytes parent folder | download | duplicates (12)
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
27
28
29
30
Adjacency list:
0 -> 4,1,
1 -> 5,0,
2 -> 3,6,5,
3 -> 7,6,2,
4 -> 0,
5 -> 6,2,1,
6 -> 7,5,3,2,
7 -> 6,3,
Edge list:
Source: 0,Target: 4 (Id: 1)
Source: 0,Target: 1 (Id: 0)
Source: 1,Target: 5 (Id: 2)
Source: 2,Target: 3 (Id: 5)
Source: 2,Target: 6 (Id: 4)
Source: 2,Target: 5 (Id: 3)
Source: 3,Target: 7 (Id: 7)
Source: 3,Target: 6 (Id: 6)
Source: 5,Target: 6 (Id: 8)
Source: 6,Target: 7 (Id: 9)

Breadth-First search: 
Vertex r: Level = 1, Predecessor = s
Vertex s: Level = 0, Predecessor = nil
Vertex t: Level = 2, Predecessor = w
Vertex u: Level = 3, Predecessor = x
Vertex v: Level = 2, Predecessor = r
Vertex w: Level = 1, Predecessor = s
Vertex x: Level = 2, Predecessor = w
Vertex y: Level = 3, Predecessor = x