Easy input-output function for common graphs.
Modified Exception handling in graph_reader.
2 id cost color description mmap
3 1 1 green "A -> B \t: 10" a
4 2 2 blue "A -> B \t: 10" b
5 # hatalom dicsoseg "A -> B \t: 10" c
6 3 1 red "A -> B \t: 10" d #adjkhj
7 4 2 red "A -> B \t: 10" e
8 5 1 green "A -> B \t: 10" f
9 10 1 green "A -> B \t: 10" g
10 # hello - bello csucsok "A -> B \t: 10"
11 6 2 blue "A -> B \t: 10" h
12 7 1 blue "A -> B \t: 10" i
13 8 2 red "A -> B \t: 10" j
14 9 1 green "A -> B \t: 10" k
17 id weight description mmap
18 1 4 1 10 "A -> B \t: 101" a
19 3 5 5 29 "A -> B \t: 10q" b
20 3 4 2 92 "A -> B \t: 10a" c
21 2 3 6 92 "A -> B \t: 10d" d
22 6 5 9 49 "A -> B \t: 10c" e
23 10 4 3 40 "A -> B \t: 10v" f
24 1 3 8 84 "A -> B \t: 10g" g
27 6 7 4 83 "A -> B \t: 10h" h
28 8 9 7 37 "A -> B \t: 10j" i
29 7 8 10 12 "A -> B \t: 10g" j