Graph theory algorithms visualized

/.../5. Shortest path problem/

2. Dijkstra's algorithm.mp4

2. Dijkstra's algorithm.srt

4. Floyd-Warshall algorithm.srt

3. Bellman-Ford algorithm.srt

2.5 FibonacciHeap.java

7. Shortest path in directed acyclic graphs.srt

5. Johnson's algorithm.srt

2.6 Tuple.java

3. Bellman-Ford algorithm.mp4

6. Shortest path in unweighted graphs.srt

7.3 ShortestPathDAG.java

3.3 BellmanFord.java

1. Introduction.srt

7.2 shortest_path_dag.py

2.1 Binary heaps YouTube video.html

2.3 dijkstra.py

5.1 Johnson.java

4.3 FloydWarshall.java

2.2 Dijkstra.java

3.4 Edge.java

3.5 Tuple.java

6.3 ShortestPathUnweighted.java

3.2 bellman_ford.py

4.2 floyd_warshall.py

5.2 johnson.py

6.2 shortest_path_unweighted.py

4. Floyd-Warshall algorithm.mp4

7. Shortest path in directed acyclic graphs.mp4

5. Johnson's algorithm.mp4

6.1 shortest path with unweighted graphs.pptx

6. Shortest path in unweighted graphs.mp4

1. Introduction.mp4

2.4 dijkstra's algorithm.pptx

3.1 bellman ford.pptx

4.1 floyd warshall.pptx

7.1 dag shortest path.pptx

1.1 shortest path intro.pptx

5.3 johnsons.pptx

/

TutsNode.net.txt

[TGx]Downloaded from torrentgalaxy.to .txt

/1. Introduction/

2. [IMPORTANT] Before we start.html

4. Terminology and types of graphs.srt

3. Python crash course (optional).html

1. Introduction to graph theory.srt

4. Terminology and types of graphs.mp4

1. Introduction to graph theory.mp4

4.1 types and terms.pptx

1.1 introduction.pptx

/.../7. Minimum spanning trees/

2. Prim's algorithm.srt

2.1 FibonacciHeap.java

3. Kruskal's algorithm.srt

1. What is a (minimum) spanning tree.srt

5. Solution Min cost to connect all points problem.srt

3.3 Kruskal.java

2.2 Prim.java

3.5 kruskal.py

1.2 FindSpanningTree.java

2.4 prim.py

5.3 MinCostConnect.java

1.1 find_spanning_tree.py

5.2 min_cost_connect.py

4. Problem Min cost to connect all points.html

3.2 DisjointSet.java

2.5 Tuple.java

6. Quiz Minimum spanning trees.html

3.1 Disjoint-set data structure YouTube video.html

2. Prim's algorithm.mp4

3. Kruskal's algorithm.mp4

1. What is a (minimum) spanning tree.mp4

5.1 min cost to connect all points.pptx

5. Solution Min cost to connect all points problem.mp4

2.3 prim.pptx

3.4 kruskal.pptx

1.3 mst-intro.pptx

/3. Graph traversal/

1. Depth-first search (DFS) algorithm.srt

4. Breadth-first search (BFS) algorithm.srt

1.2 dfs_visualization.py

1.3 Dfs.java

1.4 dfs.py

2. Problem Path exists in a graph.html

3.2 dfs_path_exists.py

3.3 DfsPathExists.java

4.1 bfs_visualization.py

4.2 Bfs.java

4.3 bfs.py

6.1 bfs path exists.pptx

5. Problem Minimum edges from start to end.html

6.3 BfsMinEdges.java

7. DFS and BFS in implicit graphs.srt

7.1 bfs_grid.py

7.2 BfsGrid.java

7.4 dfs_grid.py

7.5 DfsGrid.java

7.6 Flood fill algorithm YouTube video.html

3. Solution Path exists in a graph.srt

6. Solution Minimum edges from start to end.srt

6.2 bfs_min_edges.py

1. Depth-first search (DFS) algorithm.mp4

3.1 dfs path exists.pptx

4. Breadth-first search (BFS) algorithm.mp4

7. DFS and BFS in implicit graphs.mp4

3. Solution Path exists in a graph.mp4

6. Solution Minimum edges from start to end.mp4

4.4 breadth first search.pptx

7.3 dfs and bfs in hidden.pptx

1.1 depth-first search.pptx

/9. Graph coloring/

5. Heuristics (Welsh-Powell, DSatur).srt

1. Introduction to graph coloring.srt

3. Checking k-colorability with backtracking.srt

7. Solution Let's make a Sudoku solver.srt

4. Greedy coloring.srt

2. Checking 2-colorability (bipartite graph).srt

2.3 TwoColorability.java

7.3 SudokuSolver.java

3.3 KColorability.java

2.2 two_colorability.py

5.2 DSatur.java

6. Problem Sudoku solver.html

3.2 k_colorability.py

7.2 sudoku_solver.py

5.5 WelshPowell.java

4.3 GreedyColoring.java

5.3 dsatur.py

5.4 welsh_powell.py

4.2 greedy_coloring.py

8. Quiz Graph coloring.html

5. Heuristics (Welsh-Powell, DSatur).mp4

1. Introduction to graph coloring.mp4

4. Greedy coloring.mp4

2.1 is bipartite.pptx

3. Checking k-colorability with backtracking.mp4

7. Solution Let's make a Sudoku solver.mp4

2. Checking 2-colorability (bipartite graph).mp4

1.1 graph coloring.pptx

7.1 sudoku coloring.pptx

5.1 coloring heuristics.pptx

4.1 greedy coloring.pptx

3.1 k colorability.pptx

/.../8. Eulerian and Hamiltonian pathscycles/

2. Hierholzer's algorithm.srt

6. Hamiltonian pathcycle finding algorithms.srt

1. What is a Eulerian pathcycle.srt

5. What is a Hamiltonian pathcycle.srt

4. Solution Reconstruct itinerary.srt

4.3 ReconstructItinerary.java

2.1 Hierholzer.java

4.2 reconstruct_itinerary.py

6.3 HamiltonianBacktracking.java

2.3 hierholzer.py

3. Problem Reconstruct itinerary.html

6.2 hamiltonian_backtracking.py

5.1 hamiltonian paths.pptx

2. Hierholzer's algorithm.mp4

1. What is a Eulerian pathcycle.mp4

6.1 hamiltonian backtracking.pptx

6. Hamiltonian pathcycle finding algorithms.mp4

5. What is a Hamiltonian pathcycle.mp4

4. Solution Reconstruct itinerary.mp4

1.1 eulerian trail intro.pptx

2.2 hierholzer.pptx

4.1 reconstruct itinerary.pptx

/2. Graph representation/

1.2 graph_adj_list.py

4. Quiz Adjacency lists and matrices.html

3. Adjacency list vs adjacency matrix.srt

1. Adjacency list representation.srt

2. Adjacency matrix representation.srt

2.3 GraphAdjMat.java

2.2 graph_adj_mat.py

1.3 GraphAdjList.java

3. Adjacency list vs adjacency matrix.mp4

1. Adjacency list representation.mp4

2. Adjacency matrix representation.mp4

1.1 adjacency list.pptx

3.1 adj list vs adj mat.pptx

2.1 adjacency matrix.pptx

/4. Topological sort/

2. DFS-based topological sort algorithm.srt

3. BFS-based topological sort algorithm (Kahn's algorithm).srt

5. Solution Find all possible recipes problem.srt

1. What is topological sort.srt

2.2 topsort_dfs.py

2.3 TopsortDfs.java

3.2 topsort_bfs.py

3.3 TopsortBfs.java

4. Problem Find all possible recipes.html

5.2 find_possible_recipes.py

5.3 FindPossibleRecipes.java

6. Quiz Topological sort.html

5.1 find recipes.pptx

2. DFS-based topological sort algorithm.mp4

5. Solution Find all possible recipes problem.mp4

3. BFS-based topological sort algorithm (Kahn's algorithm).mp4

1. What is topological sort.mp4

1.1 topological sort intro.pptx

3.1 topological sort bfs.pptx

2.1 topological sort dfs.pptx

/6. Trees/

1. What is a tree.srt

2. Out-trees (arborescence) and graph to out-tree conversion.srt

3. Solution All nodes distance k in a tree problem.srt

3.2 DistanceK.java

1.2 IsTree.java

3.1 distance_k.py

2.3 ToOutTree.java

1.1 is_tree.py

2.2 to_out_tree.py

4. Quiz What is a tree.html

1. What is a tree.mp4

2.1 graph to out-tree.pptx

3. Solution All nodes distance k in a tree problem.mp4

3.3 nodes at a distance k.pptx

2. Out-trees (arborescence) and graph to out-tree conversion.mp4

1.3 trees introduction.pptx

/.pad/

0

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

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

Total files 274