All graphs can be visualized using CS Academy Graph Visualizer and the input provided in the sections below.
- Graph Algorithms
- Table of Contents
- Graph Attributes
- Undirected graphs
- Directed graphs
Each graph has different attributes which can be seen looking at the graph but are also shown as a badge for each graph here. Have a look at the following table to see all badges and their meaning.
| Badge | Description |
|---|---|
  |
Shows whether a graph is directed or not |
  |
Shows whether a graph is weighted or not. "unweighted" here means the default weight 1.0 is applied! |
 |
Shows which algorithms of the implemented algorithms can be applied to this graph. Some algorithms won't work with any graph! See section "Algorithms" to see the meaning of the abbreviations used here. |
| Abbreviation | Name | Prerequisites |
|---|---|---|
| BFS | Breadth-First Search | - connected (in this implementation) |
| DFS | Depth-First Search | |
| MST | Minimal Spanning Tree | - undirected graph - weighted - connected |
| DIJ | Dijkstra (single-pair shortest path) | - No negative weights on edges |
| BMF | Bellmann-Ford (single-pair shortest path) | - No negative cycles within the graph - weighted |
| FWS | Floyd-Warshall (all-pairs shortest paths) | - No negative cycles within the graph - weighted - directed |
Graph as shown in lecture 19 on page 4 for BFS and 13 for DFS.
8
0 4
0 1
1 5
5 2
5 6
2 3
2 6
6 3
6 7
3 7
Graph as shown in lecture 19 on page 22.
9
0 1
0 4
1 2
1 6
1 8
3 4
3 7
4 5
6 7
6
0 2
0 4
0 5
1 4
1 5
2 3
2 4
4 5
Graph as shown in lecture 20 on page 13 for Kruskal's algorithm and page 24 for Prim's algorithm.
9
0 1 4
0 8 8
1 3 8
2 3 2
2 7 6
2 8 7
3 4 7
3 6 4
4 5 9
4 6 14
5 6 10
6 7 2
7 8 1
Graph similar to the graph in the exam for the summer term 2021 for the application of Prim's algorithms.
21
0 6 15
0 1 9
1 7 1
1 2 2
2 8 17
2 3 8
3 9 13
3 4 14
4 10 21
4 5 18
5 10 1
10 14 11
10 9 12
9 14 10
9 8 2
8 13 4
8 7 15
7 12 13
7 6 21
6 11 19
11 15 5
11 12 19
12 16 3
12 13 10
13 17 17
13 14 9
14 17 9
17 19 7
17 16 7
16 19 16
16 15 11
15 18 8
18 20 8
18 19 14
19 20 6
Graph as used in summer term exam of 2018 for Kruskal and Dijkstra's algorithm.
8
1 2 28
1 3 24
1 4 26
1 6 3
2 3 2
2 8 1
3 4 6
4 5 4
5 6 5
6 7 23
6 8 22
7 8 7
Graph as used in summer term exam of 2018 for Kruskal and Dijkstra's algorithm.
17
0 13 3
0 15 11
1 13 2
1 2 4
2 3 5
3 13 21
3 4 13
3 8 20
4 5 14
5 8 6
5 6 22
6 7 19
7 8 12
8 9 25
8 14 18
9 10 23
9 12 15
10 11 17
11 12 5
11 16 16
12 14 10
12 15 7
13 14 8
15 16 1
Simple graph from Wikipedia used to show how Floyd-Warshall algorithm works.
4
1 3 -2
2 1 4
2 3 3
3 4 2
4 2 -1
Graph as shown in lecture 21 on page 11.
9
0 4
1 0
1 6
1 8
2 1
4 3
5 4
6 7
7 3
Graph as shown in lecture 19 on page 26.
5
0 1 3
0 3 5
1 2 6
1 3 1
2 4 1
3 1 1
3 2 4
3 4 6
4 0 3
4 2 7
Graph as shown in lecture 21 on page 21.
5
0 1 6
0 3 7
1 2 5
1 3 8
1 4 -4
2 1 -2
3 2 -3
3 4 9
4 0 2
4 2 7
Graph as shown in lecture 22 on page 22.
5
1 2 3
1 3 8
1 5 -4
2 4 1
2 5 7
3 2 4
4 1 2
4 3 -5
5 4 6