|
|
0
|
|
0 B
|
|
|
1. Adjacency list representation.mp4
|
MP4
|
62.2 MB
|
|
|
1. Adjacency list representation.srt
|
SRT
|
13.8 KB
|
|
|
1. Depth-first search (DFS) algorithm.mp4
|
MP4
|
93.2 MB
|
|
|
1. Depth-first search (DFS) algorithm.srt
|
SRT
|
24 KB
|
|
|
1. Introduction to graph theory.mp4
|
MP4
|
45.5 MB
|
|
|
1. Introduction to graph theory.srt
|
SRT
|
7.1 KB
|
|
|
1. Introduction.srt
|
SRT
|
4.4 KB
|
|
|
1
|
|
155 KB
|
|
|
1. Introduction to graph coloring.mp4
|
MP4
|
96.7 MB
|
|
|
1. Introduction to graph coloring.srt
|
SRT
|
17.4 KB
|
|
|
1. Introduction.mp4
|
MP4
|
29.4 MB
|
|
|
1. What is a (minimum) spanning tree.mp4
|
MP4
|
55.3 MB
|
|
|
1. What is a (minimum) spanning tree.srt
|
SRT
|
10.3 KB
|
|
|
1. What is a Eulerian pathcycle.mp4
|
MP4
|
89.4 MB
|
|
|
1. What is a Eulerian pathcycle.srt
|
SRT
|
10.6 KB
|
|
|
1. What is a tree.mp4
|
MP4
|
82.1 MB
|
|
|
1. What is a tree.srt
|
SRT
|
14.1 KB
|
|
|
1. What is topological sort.mp4
|
MP4
|
58.9 MB
|
|
|
1. What is topological sort.srt
|
SRT
|
10.9 KB
|
|
|
1.1 adjacency list.pptx
|
PPTX
|
890.5 KB
|
|
|
1.1 depth-first search.pptx
|
PPTX
|
1.5 MB
|
|
|
1.1 eulerian trail intro.pptx
|
PPTX
|
1.6 MB
|
|
|
1.1 find_spanning_tree.py
|
PY
|
1.6 KB
|
|
|
1.1 graph coloring.pptx
|
PPTX
|
2.8 MB
|
|
|
1.1 introduction.pptx
|
PPTX
|
2.3 MB
|
|
|
1.1 is_tree.py
|
PY
|
1.8 KB
|
|
|
1.1 shortest path intro.pptx
|
PPTX
|
1.2 MB
|
|
|
1.1 topological sort intro.pptx
|
PPTX
|
808.3 KB
|
|
|
1.2 FindSpanningTree.java
|
JAVA
|
2.4 KB
|
|
|
1.2 IsTree.java
|
JAVA
|
3.5 KB
|
|
|
1.2 dfs_visualization.py
|
PY
|
2.8 KB
|
|
|
1.2 graph_adj_list.py
|
PY
|
2.8 KB
|
|
|
1.3 Dfs.java
|
JAVA
|
1.9 KB
|
|
|
1.3 GraphAdjList.java
|
JAVA
|
3.5 KB
|
|
|
1.3 mst-intro.pptx
|
PPTX
|
1 MB
|
|
|
1.3 trees introduction.pptx
|
PPTX
|
1.6 MB
|
|
|
1.4 dfs.py
|
PY
|
1.2 KB
|
|
|
2. Adjacency matrix representation.mp4
|
MP4
|
47.6 MB
|
|
|
2. Adjacency matrix representation.srt
|
SRT
|
9.1 KB
|
|
|
2. Checking 2-colorability (bipartite graph).mp4
|
MP4
|
44.1 MB
|
|
|
2. Checking 2-colorability (bipartite graph).srt
|
SRT
|
11.6 KB
|
|
|
2. DFS-based topological sort algorithm.mp4
|
MP4
|
86.3 MB
|
|
|
2. DFS-based topological sort algorithm.srt
|
SRT
|
18.8 KB
|
|
|
2. Dijkstra's algorithm.mp4
|
MP4
|
213.5 MB
|
|
|
2. Dijkstra's algorithm.srt
|
SRT
|
49.8 KB
|
|
|
2. Hierholzer's algorithm.mp4
|
MP4
|
94 MB
|
|
|
2. Out-trees (arborescence) and graph to out-tree conversion.srt
|
SRT
|
7.8 KB
|
|
|
2. Prim's algorithm.mp4
|
MP4
|
124.3 MB
|
|
|
2. Prim's algorithm.srt
|
SRT
|
26.5 KB
|
|
|
2. Problem Path exists in a graph.html
|
HTML
|
1.3 KB
|
|
|
2
|
|
145.9 KB
|
|
|
2. Hierholzer's algorithm.srt
|
SRT
|
22.5 KB
|
|
|
2. Out-trees (arborescence) and graph to out-tree conversion.mp4
|
MP4
|
41 MB
|
|
|
2. [IMPORTANT] Before we start.html
|
HTML
|
2.8 KB
|
|
|
2.1 Binary heaps YouTube video.html
|
HTML
|
102.4 B
|
|
|
2.1 FibonacciHeap.java
|
JAVA
|
23.8 KB
|
|
|
2.1 Hierholzer.java
|
JAVA
|
2.9 KB
|
|
|
2.1 adjacency matrix.pptx
|
PPTX
|
1 MB
|
|
|
2.1 graph to out-tree.pptx
|
PPTX
|
922.8 KB
|
|
|
2.1 is bipartite.pptx
|
PPTX
|
759.7 KB
|
|
|
2.1 topological sort dfs.pptx
|
PPTX
|
1.3 MB
|
|
|
2.2 Dijkstra.java
|
JAVA
|
3.8 KB
|
|
|
2.2 Prim.java
|
JAVA
|
3.5 KB
|
|
|
2.2 graph_adj_mat.py
|
PY
|
4 KB
|
|
|
2.2 hierholzer.pptx
|
PPTX
|
1.4 MB
|
|
|
2.2 to_out_tree.py
|
PY
|
1.3 KB
|
|
|
2.2 topsort_dfs.py
|
PY
|
1.3 KB
|
|
|
2.2 two_colorability.py
|
PY
|
2.5 KB
|
|
|
2.3 GraphAdjMat.java
|
JAVA
|
5.2 KB
|
|
|
2.3 ToOutTree.java
|
JAVA
|
2.4 KB
|
|
|
2.3 TopsortDfs.java
|
JAVA
|
2.2 KB
|
|
|
2.3 TwoColorability.java
|
JAVA
|
3.3 KB
|
|
|
2.3 dijkstra.py
|
PY
|
2 KB
|
|
|
2.3 hierholzer.py
|
PY
|
1.7 KB
|
|
|
2.3 prim.pptx
|
PPTX
|
3.8 MB
|
|
|
2.4 dijkstra's algorithm.pptx
|
PPTX
|
4.1 MB
|
|
|
2.4 prim.py
|
PY
|
2.1 KB
|
|
|
2.5 FibonacciHeap.java
|
JAVA
|
23.8 KB
|
|
|
2.5 Tuple.java
|
JAVA
|
307.2 B
|
|
|
2.6 Tuple.java
|
JAVA
|
307.2 B
|
|
|
3. Adjacency list vs adjacency matrix.mp4
|
MP4
|
71.6 MB
|
|
|
3. Adjacency list vs adjacency matrix.srt
|
SRT
|
13.8 KB
|
|
|
3. BFS-based topological sort algorithm (Kahn's algorithm).mp4
|
MP4
|
77.1 MB
|
|
|
3. BFS-based topological sort algorithm (Kahn's algorithm).srt
|
SRT
|
16.5 KB
|
|
|
3. Bellman-Ford algorithm.mp4
|
MP4
|
200.6 MB
|
|
|
3. Bellman-Ford algorithm.srt
|
SRT
|
34.4 KB
|
|
|
3. Checking k-colorability with backtracking.mp4
|
MP4
|
62 MB
|
|
|
3. Checking k-colorability with backtracking.srt
|
SRT
|
14 KB
|
|
|
3. Kruskal's algorithm.mp4
|
MP4
|
82.7 MB
|
|
|
3. Kruskal's algorithm.srt
|
SRT
|
14 KB
|
|
|
3. Problem Reconstruct itinerary.html
|
HTML
|
1.6 KB
|
|
|
3. Python crash course (optional).html
|
HTML
|
9 KB
|
|
|
3. Solution All nodes distance k in a tree problem.mp4
|
MP4
|
51.1 MB
|
|
|
3. Solution All nodes distance k in a tree problem.srt
|
SRT
|
10.4 KB
|
|
|
3. Solution Path exists in a graph.mp4
|
MP4
|
49.7 MB
|
|
|
3. Solution Path exists in a graph.srt
|
SRT
|
10.5 KB
|
|
|
3
|
|
9.8 KB
|
|
|
3.1 Disjoint-set data structure YouTube video.html
|
HTML
|
102.4 B
|
|
|
3.1 adj list vs adj mat.pptx
|
PPTX
|
1.5 MB
|
|
|
3.1 bellman ford.pptx
|
PPTX
|
3 MB
|
|
|
3.1 dfs path exists.pptx
|
PPTX
|
839.5 KB
|
|
|
3.1 distance_k.py
|
PY
|
2.9 KB
|
|
|
3.1 k colorability.pptx
|
PPTX
|
1 MB
|
|
|
3.1 topological sort bfs.pptx
|
PPTX
|
1.3 MB
|
|
|
3.2 DisjointSet.java
|
JAVA
|
1.2 KB
|
|
|
3.2 DistanceK.java
|
JAVA
|
4.2 KB
|
|
|
3.2 bellman_ford.py
|
PY
|
3.2 KB
|
|
|
3.2 dfs_path_exists.py
|
PY
|
1.1 KB
|
|
|
3.2 k_colorability.py
|
PY
|
2 KB
|
|
|
3.2 topsort_bfs.py
|
PY
|
1.3 KB
|
|
|
3.3 BellmanFord.java
|
JAVA
|
5.8 KB
|
|
|
3.3 DfsPathExists.java
|
JAVA
|
1.5 KB
|
|
|
3.3 KColorability.java
|
JAVA
|
2.6 KB
|
|
|
3.3 Kruskal.java
|
JAVA
|
3.5 KB
|
|
|
3.3 TopsortBfs.java
|
JAVA
|
2.2 KB
|
|
|
3.3 nodes at a distance k.pptx
|
PPTX
|
895.2 KB
|
|
|
3.4 Edge.java
|
JAVA
|
512 B
|
|
|
3.4 kruskal.pptx
|
PPTX
|
1.6 MB
|
|
|
3.5 Tuple.java
|
JAVA
|
307.2 B
|
|
|
3.5 kruskal.py
|
PY
|
2.9 KB
|
|
|
4. Floyd-Warshall algorithm.mp4
|
MP4
|
196.9 MB
|
|
|
4. Floyd-Warshall algorithm.srt
|
SRT
|
36 KB
|
|
|
4
|
|
83.7 KB
|
|
|
4. Breadth-first search (BFS) algorithm.mp4
|
MP4
|
77.5 MB
|
|
|
4. Breadth-first search (BFS) algorithm.srt
|
SRT
|
17.2 KB
|
|
|
4. Greedy coloring.mp4
|
MP4
|
71.3 MB
|
|
|
4. Greedy coloring.srt
|
SRT
|
13 KB
|
|
|
4. Problem Find all possible recipes.html
|
HTML
|
1.4 KB
|
|
|
4. Problem Min cost to connect all points.html
|
HTML
|
1.3 KB
|
|
|
4. Quiz Adjacency lists and matrices.html
|
HTML
|
204.8 B
|
|
|
4. Quiz What is a tree.html
|
HTML
|
204.8 B
|
|
|
4. Solution Reconstruct itinerary.mp4
|
MP4
|
41.8 MB
|
|
|
4. Solution Reconstruct itinerary.srt
|
SRT
|
6.5 KB
|
|
|
4. Terminology and types of graphs.mp4
|
MP4
|
146 MB
|
|
|
4. Terminology and types of graphs.srt
|
SRT
|
25.3 KB
|
|
|
4.1 bfs_visualization.py
|
PY
|
2.8 KB
|
|
|
4.1 floyd warshall.pptx
|
PPTX
|
2.2 MB
|
|
|
4.1 greedy coloring.pptx
|
PPTX
|
1.4 MB
|
|
|
4.1 types and terms.pptx
|
PPTX
|
2.8 MB
|
|
|
4.2 Bfs.java
|
JAVA
|
2.1 KB
|
|
|
4.2 floyd_warshall.py
|
PY
|
2.2 KB
|
|
|
4.2 greedy_coloring.py
|
PY
|
1 KB
|
|
|
4.2 reconstruct_itinerary.py
|
PY
|
1.8 KB
|
|
|
4.3 FloydWarshall.java
|
JAVA
|
3.8 KB
|
|
|
4.3 GreedyColoring.java
|
JAVA
|
1.8 KB
|
|
|
4.3 ReconstructItinerary.java
|
JAVA
|
3 KB
|
|
|
4.3 bfs.py
|
PY
|
1.4 KB
|
|
|
4.4 breadth first search.pptx
|
PPTX
|
1.7 MB
|
|
|
5. Johnson's algorithm.srt
|
SRT
|
13.2 KB
|
|
|
5
|
|
311.4 KB
|
|
|
5. Heuristics (Welsh-Powell, DSatur).mp4
|
MP4
|
111.7 MB
|
|
|
5. Heuristics (Welsh-Powell, DSatur).srt
|
SRT
|
23.9 KB
|
|
|
5. Johnson's algorithm.mp4
|
MP4
|
77.8 MB
|
|
|
5. Problem Minimum edges from start to end.html
|
HTML
|
1 KB
|
|
|
5. Solution Find all possible recipes problem.mp4
|
MP4
|
79.8 MB
|
|
|
5. Solution Find all possible recipes problem.srt
|
SRT
|
14.7 KB
|
|
|
5. Solution Min cost to connect all points problem.mp4
|
MP4
|
40.2 MB
|
|
|
5. Solution Min cost to connect all points problem.srt
|
SRT
|
6.3 KB
|
|
|
5. What is a Hamiltonian pathcycle.mp4
|
MP4
|
44.2 MB
|
|
|
5. What is a Hamiltonian pathcycle.srt
|
SRT
|
7.6 KB
|
|
|
5.1 Johnson.java
|
JAVA
|
3.9 KB
|
|
|
5.1 coloring heuristics.pptx
|
PPTX
|
2.4 MB
|
|
|
5.1 find recipes.pptx
|
PPTX
|
647.8 KB
|
|
|
5.1 hamiltonian paths.pptx
|
PPTX
|
966 KB
|
|
|
5.1 min cost to connect all points.pptx
|
PPTX
|
936.9 KB
|
|
|
5.2 DSatur.java
|
JAVA
|
2.4 KB
|
|
|
5.2 find_possible_recipes.py
|
PY
|
2 KB
|
|
|
5.2 johnson.py
|
PY
|
2.3 KB
|
|
|
5.2 min_cost_connect.py
|
PY
|
1.5 KB
|
|
|
5.3 FindPossibleRecipes.java
|
JAVA
|
2.9 KB
|
|
|
5.3 MinCostConnect.java
|
JAVA
|
1.9 KB
|
|
|
5.3 dsatur.py
|
PY
|
1.3 KB
|
|
|
5.4 welsh_powell.py
|
PY
|
1 KB
|
|
|
5.5 WelshPowell.java
|
JAVA
|
1.9 KB
|
|
|
6
|
|
290.9 KB
|
|
|
6. Hamiltonian pathcycle finding algorithms.mp4
|
MP4
|
46.2 MB
|
|
|
6. Hamiltonian pathcycle finding algorithms.srt
|
SRT
|
11.8 KB
|
|
|
6. Problem Sudoku solver.html
|
HTML
|
2.3 KB
|
|
|
6. Quiz Minimum spanning trees.html
|
HTML
|
204.8 B
|
|
|
6. Quiz Topological sort.html
|
HTML
|
204.8 B
|
|
|
6. Shortest path in unweighted graphs.mp4
|
MP4
|
46.1 MB
|
|
|
6. Shortest path in unweighted graphs.srt
|
SRT
|
8.5 KB
|
|
|
6. Solution Minimum edges from start to end.mp4
|
MP4
|
44.4 MB
|
|
|
6. Solution Minimum edges from start to end.srt
|
SRT
|
8.9 KB
|
|
|
6.1 hamiltonian backtracking.pptx
|
PPTX
|
948.8 KB
|
|
|
6.1 shortest path with unweighted graphs.pptx
|
PPTX
|
901.3 KB
|
|
|
6.2 bfs_min_edges.py
|
PY
|
1 KB
|
|
|
6.2 hamiltonian_backtracking.py
|
PY
|
1.2 KB
|
|
|
6.2 shortest_path_unweighted.py
|
PY
|
1.7 KB
|
|
|
6.3 BfsMinEdges.java
|
JAVA
|
1.4 KB
|
|
|
6.3 HamiltonianBacktracking.java
|
JAVA
|
1.8 KB
|
|
|
6.3 ShortestPathUnweighted.java
|
JAVA
|
3.5 KB
|
|
|
7. DFS and BFS in implicit graphs.mp4
|
MP4
|
56.6 MB
|
|
|
7. DFS and BFS in implicit graphs.srt
|
SRT
|
11.7 KB
|
|
|
7. Shortest path in directed acyclic graphs.mp4
|
MP4
|
86.4 MB
|
|
|
7. Shortest path in directed acyclic graphs.srt
|
SRT
|
16.5 KB
|
|
|
7. Solution Let's make a Sudoku solver.mp4
|
MP4
|
55.7 MB
|
|
|
7. Solution Let's make a Sudoku solver.srt
|
SRT
|
13.8 KB
|
|
|
7.1 bfs_grid.py
|
PY
|
1.4 KB
|
|
|
7.1 dag shortest path.pptx
|
PPTX
|
1.7 MB
|
|
|
7.1 sudoku coloring.pptx
|
PPTX
|
2.5 MB
|
|
|
7.2 BfsGrid.java
|
JAVA
|
1.8 KB
|
|
|
7.2 shortest_path_dag.py
|
PY
|
4.2 KB
|
|
|
7.2 sudoku_solver.py
|
PY
|
2 KB
|
|
|
7.3 ShortestPathDAG.java
|
JAVA
|
6.5 KB
|
|
|
7.3 SudokuSolver.java
|
JAVA
|
3.2 KB
|
|
|
7.3 dfs and bfs in hidden.pptx
|
PPTX
|
1.7 MB
|
|
|
7.4 dfs_grid.py
|
PY
|
1.4 KB
|
|
|
7.5 DfsGrid.java
|
JAVA
|
1.6 KB
|
|
|
7.6 Flood fill algorithm YouTube video.html
|
HTML
|
102.4 B
|
|
|
8. Quiz Graph coloring.html
|
HTML
|
204.8 B
|
|
|
TutsNode.net.txt
|
TXT
|
102.4 B
|
|
|
[TGx]Downloaded from torrentgalaxy.to .txt
|
TXT
|
614.4 B
|
|
|
7
|
|
16.5 KB
|
|
|
8
|
|
6.5 KB
|
|
|
9
|
|
612.4 KB
|
|
|
10
|
|
572.3 KB
|
|
|
11
|
|
702.6 KB
|
|
|
12
|
|
258.6 KB
|
|
|
13
|
|
11.5 KB
|
|
|
14
|
|
169.9 KB
|
|
|
15
|
|
192.9 KB
|
|
|
16
|
|
478.7 KB
|
|
|
17
|
|
20.7 KB
|
|
|
18
|
|
418.1 KB
|
|
|
19
|
|
673.5 KB
|
|
|
20
|
|
40.3 KB
|
|
|
21
|
|
41.3 KB
|
|
|
22
|
|
125.3 KB
|
|
|
23
|
|
383 KB
|
|
|
24
|
|
343.2 KB
|
|
|
25
|
|
747.1 KB
|
|
|
26
|
|
39 KB
|
|
|
27
|
|
281.4 KB
|
|
|
28
|
|
443 KB
|
|
|
29
|
|
38.4 KB
|
|
|
30
|
|
31.5 KB
|
|
|
31
|
|
562.6 KB
|
|
|
32
|
|
607.2 KB
|
|
|
33
|
|
860.9 KB
|
|
|
34
|
|
883.2 KB
|
|
|
35
|
|
204.9 KB
|
|
|
36
|
|
32.8 KB
|
|
|
37
|
|
851 KB
|
|
|
38
|
|
566.8 KB
|
|
|
39
|
|
36.2 KB
|
|
|
40
|
|
229.1 KB
|
|
|
41
|
|
999 KB
|
|
|
42
|
|
179.3 KB
|
|
|
43
|
|
226.6 KB
|
|
|
44
|
|
465.6 KB
|
|
|
45
|
|
610.1 KB
|
|
|
46
|
|
709.3 KB
|
|
|
47
|
|
798.7 KB
|
|
|
48
|
|
267.2 KB
|
|
|
49
|
|
286.9 KB
|
|
|
50
|
|
320.4 KB
|
|
|
51
|
|
388.9 KB
|
|
|
52
|
|
416.9 KB
|
|
|
53
|
|
433.5 KB
|
|
|
54
|
|
509.6 KB
|
|
|
55
|
|
529.1 KB
|
|
|
56
|
|
584.5 KB
|
|
|
57
|
|
598.2 KB
|
|
|
58
|
|
687.8 KB
|
|
|
59
|
|
713.6 KB
|
|
|
60
|
|
857.1 KB
|
|
|
61
|
|
978.5 KB
|
|
|
62
|
|
979.8 KB
|
|
|
63
|
|
10 KB
|
