Data structures:
- Graphs
- Edges
Algorithms:
- DFS (iterative and recursive)
- BFS (iterative and recursive)
a
/ \
b c
/ \ \
d e f
3
/ \
11 4
/ \ \
4 2 1
5
/ \
11 3
/ \ \
4 15 12
a: ['b', 'c']
b: ['d']
c: ['e']
d: ['f']
e: []
f: []
f: ['g', 'i']
g: ['h']
h: []
i: ['g', 'k']
j: ['i']
k: []
i: [j, k],
j: [i],
k: [i, m, l],
l: [k],
m: [k],
n: [o],
o: [n]
3: [],
4: [6],
6: [4, 5, 7, 8]
8: [6],
7: [6],
5: [6],
1: [2],
2: [1]
0: [8, 1, 5],
1: [0],
5: [0, 8],
8: [0, 5],
2: [3, 4],
3: [2, 4],
4: [3, 2]
w: [x, v],
x: [w, y],
y: [x, z],
v: [w, z],
z: [v, y],
[
[i, j],
[k, i],
[m, k],
[k, l],
[o, n]
]
[
[w, x],
[x, y],
[z, y],
[z, v],
[w, v],
]
| w | l | w | w | l | w |
| l | l | w | w | l | w |
| w | l | w | w | w | w |
| w | w | w | l | l | w |
| w | l | w | l | l | w |
| w | w | w | w | w | w |