[TutsNode.net] - Graph theory algorithms visualized

  5. Shortest path problem

   2. Dijkstra's algorithm.srt

   3. Bellman-Ford algorithm.srt

   7. Shortest path in directed acyclic graphs.srt

   2.6 Tuple.java

   6. Shortest path in unweighted graphs.srt

   3.3 BellmanFord.java

   7.2 shortest_path_dag.py

   2.3 dijkstra.py

   4.3 FloydWarshall.java

   3.4 Edge.java

   6.3 ShortestPathUnweighted.java

   4.2 floyd_warshall.py

   6.2 shortest_path_unweighted.py

   7. Shortest path in directed acyclic graphs.mp4

   6.1 shortest path with unweighted graphs.pptx

   1. Introduction.mp4

   3.1 bellman ford.pptx

   7.1 dag shortest path.pptx

   5.3 johnsons.pptx

  1. Introduction

   4. Terminology and types of graphs.srt

   1. Introduction to graph theory.srt

   1. Introduction to graph theory.mp4

   1.1 introduction.pptx

  7. Minimum spanning trees

   2.1 FibonacciHeap.java

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

   3.3 Kruskal.java

   3.5 kruskal.py

   2.4 prim.py

   1.1 find_spanning_tree.py

   4. Problem Min cost to connect all points.html

   2.5 Tuple.java

   3.1 Disjoint-set data structure YouTube video.html

   3. Kruskal's algorithm.mp4

   5.1 min cost to connect all points.pptx

   2.3 prim.pptx

   1.3 mst-intro.pptx

  3. Graph traversal

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

   1.3 Dfs.java

   2. Problem Path exists in a graph.html

   3.3 DfsPathExists.java

   4.2 Bfs.java

   6.1 bfs path exists.pptx

   6.3 BfsMinEdges.java

   7.1 bfs_grid.py

   7.4 dfs_grid.py

   7.6 Flood fill algorithm YouTube video.html

   6. Solution Minimum edges from start to end.srt

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

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

   3. Solution Path exists in a graph.mp4

   4.4 breadth first search.pptx

   1.1 depth-first search.pptx

  9. Graph coloring

   1. Introduction to graph coloring.srt

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

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

   7.3 SudokuSolver.java

   2.2 two_colorability.py

   6. Problem Sudoku solver.html

   7.2 sudoku_solver.py

   4.3 GreedyColoring.java

   5.4 welsh_powell.py

   8. Quiz Graph coloring.html

   1. Introduction to graph coloring.mp4

   2.1 is bipartite.pptx

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

   1.1 graph coloring.pptx

   5.1 coloring heuristics.pptx

   3.1 k colorability.pptx

  8. Eulerian and Hamiltonian pathscycles

   6. Hamiltonian pathcycle finding algorithms.srt

   5. What is a Hamiltonian pathcycle.srt

   4.3 ReconstructItinerary.java

   4.2 reconstruct_itinerary.py

   2.3 hierholzer.py

   6.2 hamiltonian_backtracking.py

   2. Hierholzer's algorithm.mp4

   6.1 hamiltonian backtracking.pptx

   5. What is a Hamiltonian pathcycle.mp4

   1.1 eulerian trail intro.pptx

   4.1 reconstruct itinerary.pptx

  2. Graph representation

   4. Quiz Adjacency lists and matrices.html

   1. Adjacency list representation.srt

   2.3 GraphAdjMat.java

   1.3 GraphAdjList.java

   1. Adjacency list representation.mp4

   1.1 adjacency list.pptx

   2.1 adjacency matrix.pptx

  4. Topological sort

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

   1. What is topological sort.srt

   2.3 TopsortDfs.java

   3.3 TopsortBfs.java

   5.2 find_possible_recipes.py

   6. Quiz Topological sort.html

   2. DFS-based topological sort algorithm.mp4

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

   1.1 topological sort intro.pptx

   2.1 topological sort dfs.pptx

  6. Trees

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

   3.2 DistanceK.java

   3.1 distance_k.py

   1.1 is_tree.py

   4. Quiz What is a tree.html

   2.1 graph to out-tree.pptx

   3.3 nodes at a distance k.pptx

   1.3 trees introduction.pptx

 TutsNode.net.txt

 .pad

  1

  3

  5

  7

  9

  11

  13

  15

  17

  19

  21

  23

  25

  27

  29

  31

  33

  35

  37

  39

  41

  43

  45

  47

  49

  51

  53

  55

  57

  59

  61

  63