[ DevCourseWeb.com ] Udemy - Graph theory algorithms visualized

Creation Time	March 28, 2024, 4:08 p.m.
Last Access Time	Sept. 1, 2025, 6:58 a.m.
File Size	3.1 GB
Keywords	visualized theory Graph - Udemy DevCourseWeb algorithms com
Total Requests	200
Total Files	210
Magnet Link	Please wait ...
	Download (Magnet Link) Play (Watch Online)

~Get Your Files Here !/5. Shortest path problem/2. Dijkstra's algorithm.mp4 213.5 MB
~Get Your Files Here !/5. Shortest path problem/3. Bellman-Ford algorithm.mp4 200.6 MB
~Get Your Files Here !/5. Shortest path problem/4. Floyd-Warshall algorithm.mp4 196.9 MB
~Get Your Files Here !/1. Introduction/4. Terminology and types of graphs.mp4 146.0 MB
~Get Your Files Here !/7. Minimum spanning trees/2. Prim's algorithm.mp4 124.3 MB
~Get Your Files Here !/9. Graph coloring/5. Heuristics (Welsh-Powell, DSatur).mp4 111.7 MB
~Get Your Files Here !/9. Graph coloring/1. Introduction to graph coloring.mp4 96.7 MB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/2. Hierholzer's algorithm.mp4 94.0 MB
~Get Your Files Here !/3. Graph traversal/1. Depth-first search (DFS) algorithm.mp4 93.2 MB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/1. What is a Eulerian pathcycle.mp4 89.4 MB
~Get Your Files Here !/5. Shortest path problem/7. Shortest path in directed acyclic graphs.mp4 86.4 MB
~Get Your Files Here !/4. Topological sort/2. DFS-based topological sort algorithm.mp4 86.3 MB
~Get Your Files Here !/7. Minimum spanning trees/3. Kruskal's algorithm.mp4 82.7 MB
~Get Your Files Here !/6. Trees/1. What is a tree.mp4 82.1 MB
~Get Your Files Here !/4. Topological sort/5. Solution Find all possible recipes problem.mp4 79.8 MB
~Get Your Files Here !/5. Shortest path problem/5. Johnson's algorithm.mp4 77.8 MB
~Get Your Files Here !/3. Graph traversal/4. Breadth-first search (BFS) algorithm.mp4 77.5 MB
~Get Your Files Here !/4. Topological sort/3. BFS-based topological sort algorithm (Kahn's algorithm).mp4 77.1 MB
~Get Your Files Here !/2. Graph representation/3. Adjacency list vs adjacency matrix.mp4 71.6 MB
~Get Your Files Here !/9. Graph coloring/4. Greedy coloring.mp4 71.3 MB
~Get Your Files Here !/2. Graph representation/1. Adjacency list representation.mp4 62.2 MB
~Get Your Files Here !/9. Graph coloring/3. Checking k-colorability with backtracking.mp4 62.0 MB
~Get Your Files Here !/4. Topological sort/1. What is topological sort.mp4 58.9 MB
~Get Your Files Here !/3. Graph traversal/7. DFS and BFS in implicit graphs.mp4 56.6 MB
~Get Your Files Here !/9. Graph coloring/7. Solution Let's make a Sudoku solver.mp4 55.7 MB
~Get Your Files Here !/7. Minimum spanning trees/1. What is a (minimum) spanning tree.mp4 55.3 MB
~Get Your Files Here !/6. Trees/3. Solution All nodes distance k in a tree problem.mp4 51.1 MB
~Get Your Files Here !/3. Graph traversal/3. Solution Path exists in a graph.mp4 49.7 MB
~Get Your Files Here !/2. Graph representation/2. Adjacency matrix representation.mp4 47.6 MB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/6. Hamiltonian pathcycle finding algorithms.mp4 46.2 MB
~Get Your Files Here !/5. Shortest path problem/6. Shortest path in unweighted graphs.mp4 46.1 MB
~Get Your Files Here !/1. Introduction/1. Introduction to graph theory.mp4 45.5 MB
~Get Your Files Here !/3. Graph traversal/6. Solution Minimum edges from start to end.mp4 44.4 MB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/5. What is a Hamiltonian pathcycle.mp4 44.2 MB
~Get Your Files Here !/9. Graph coloring/2. Checking 2-colorability (bipartite graph).mp4 44.1 MB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/4. Solution Reconstruct itinerary.mp4 41.8 MB
~Get Your Files Here !/6. Trees/2. Out-trees (arborescence) and graph to out-tree conversion.mp4 41.0 MB
~Get Your Files Here !/7. Minimum spanning trees/5. Solution Min cost to connect all points problem.mp4 40.2 MB
~Get Your Files Here !/5. Shortest path problem/1. Introduction.mp4 29.4 MB
~Get Your Files Here !/5. Shortest path problem/2.4 dijkstra's algorithm.pptx 4.1 MB
~Get Your Files Here !/7. Minimum spanning trees/2.3 prim.pptx 3.8 MB
~Get Your Files Here !/5. Shortest path problem/3.1 bellman ford.pptx 3.0 MB
~Get Your Files Here !/9. Graph coloring/1.1 graph coloring.pptx 2.8 MB
~Get Your Files Here !/1. Introduction/4.1 types and terms.pptx 2.8 MB
~Get Your Files Here !/9. Graph coloring/7.1 sudoku coloring.pptx 2.5 MB
~Get Your Files Here !/9. Graph coloring/5.1 coloring heuristics.pptx 2.4 MB
~Get Your Files Here !/1. Introduction/1.1 introduction.pptx 2.3 MB
~Get Your Files Here !/5. Shortest path problem/4.1 floyd warshall.pptx 2.2 MB
~Get Your Files Here !/3. Graph traversal/4.4 breadth first search.pptx 1.7 MB
~Get Your Files Here !/5. Shortest path problem/7.1 dag shortest path.pptx 1.7 MB
~Get Your Files Here !/3. Graph traversal/7.3 dfs and bfs in hidden.pptx 1.7 MB
~Get Your Files Here !/6. Trees/1.3 trees introduction.pptx 1.6 MB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/1.1 eulerian trail intro.pptx 1.6 MB
~Get Your Files Here !/7. Minimum spanning trees/3.4 kruskal.pptx 1.6 MB
~Get Your Files Here !/2. Graph representation/3.1 adj list vs adj mat.pptx 1.5 MB
~Get Your Files Here !/3. Graph traversal/1.1 depth-first search.pptx 1.5 MB
~Get Your Files Here !/9. Graph coloring/4.1 greedy coloring.pptx 1.4 MB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/2.2 hierholzer.pptx 1.4 MB
~Get Your Files Here !/4. Topological sort/3.1 topological sort bfs.pptx 1.3 MB
~Get Your Files Here !/4. Topological sort/2.1 topological sort dfs.pptx 1.3 MB
~Get Your Files Here !/5. Shortest path problem/1.1 shortest path intro.pptx 1.2 MB
~Get Your Files Here !/2. Graph representation/2.1 adjacency matrix.pptx 1.0 MB
~Get Your Files Here !/9. Graph coloring/3.1 k colorability.pptx 1.0 MB
~Get Your Files Here !/7. Minimum spanning trees/1.3 mst-intro.pptx 1.0 MB
~Get Your Files Here !/3. Graph traversal/6.1 bfs path exists.pptx 1008.6 KB
~Get Your Files Here !/5. Shortest path problem/5.3 johnsons.pptx 1003.3 KB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/4.1 reconstruct itinerary.pptx 1001.0 KB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/5.1 hamiltonian paths.pptx 966.0 KB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/6.1 hamiltonian backtracking.pptx 948.8 KB
~Get Your Files Here !/7. Minimum spanning trees/5.1 min cost to connect all points.pptx 936.9 KB
~Get Your Files Here !/6. Trees/2.1 graph to out-tree.pptx 922.8 KB
~Get Your Files Here !/5. Shortest path problem/6.1 shortest path with unweighted graphs.pptx 901.3 KB
~Get Your Files Here !/6. Trees/3.3 nodes at a distance k.pptx 895.2 KB
~Get Your Files Here !/2. Graph representation/1.1 adjacency list.pptx 890.5 KB
~Get Your Files Here !/3. Graph traversal/3.1 dfs path exists.pptx 839.5 KB
~Get Your Files Here !/4. Topological sort/1.1 topological sort intro.pptx 808.3 KB
~Get Your Files Here !/9. Graph coloring/2.1 is bipartite.pptx 759.7 KB
~Get Your Files Here !/4. Topological sort/5.1 find recipes.pptx 647.8 KB
~Get Your Files Here !/5. Shortest path problem/2. Dijkstra's algorithm.srt 49.8 KB
~Get Your Files Here !/5. Shortest path problem/4. Floyd-Warshall algorithm.srt 36.0 KB
~Get Your Files Here !/5. Shortest path problem/3. Bellman-Ford algorithm.srt 34.4 KB
~Get Your Files Here !/7. Minimum spanning trees/2. Prim's algorithm.srt 26.5 KB
~Get Your Files Here !/1. Introduction/4. Terminology and types of graphs.srt 25.3 KB
~Get Your Files Here !/3. Graph traversal/1. Depth-first search (DFS) algorithm.srt 24.0 KB
~Get Your Files Here !/9. Graph coloring/5. Heuristics (Welsh-Powell, DSatur).srt 23.9 KB
~Get Your Files Here !/5. Shortest path problem/2.5 FibonacciHeap.java 23.8 KB
~Get Your Files Here !/7. Minimum spanning trees/2.1 FibonacciHeap.java 23.8 KB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/2. Hierholzer's algorithm.srt 22.5 KB
~Get Your Files Here !/4. Topological sort/2. DFS-based topological sort algorithm.srt 18.8 KB
~Get Your Files Here !/9. Graph coloring/1. Introduction to graph coloring.srt 17.4 KB
~Get Your Files Here !/3. Graph traversal/4. Breadth-first search (BFS) algorithm.srt 17.2 KB
~Get Your Files Here !/5. Shortest path problem/7. Shortest path in directed acyclic graphs.srt 16.5 KB
~Get Your Files Here !/4. Topological sort/3. BFS-based topological sort algorithm (Kahn's algorithm).srt 16.5 KB
~Get Your Files Here !/4. Topological sort/5. Solution Find all possible recipes problem.srt 14.7 KB
~Get Your Files Here !/6. Trees/1. What is a tree.srt 14.1 KB
~Get Your Files Here !/7. Minimum spanning trees/3. Kruskal's algorithm.srt 14.0 KB
~Get Your Files Here !/9. Graph coloring/3. Checking k-colorability with backtracking.srt 14.0 KB
~Get Your Files Here !/9. Graph coloring/7. Solution Let's make a Sudoku solver.srt 13.8 KB
~Get Your Files Here !/2. Graph representation/3. Adjacency list vs adjacency matrix.srt 13.8 KB
~Get Your Files Here !/2. Graph representation/1. Adjacency list representation.srt 13.8 KB
~Get Your Files Here !/5. Shortest path problem/5. Johnson's algorithm.srt 13.2 KB
~Get Your Files Here !/9. Graph coloring/4. Greedy coloring.srt 13.0 KB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/6. Hamiltonian pathcycle finding algorithms.srt 11.8 KB
~Get Your Files Here !/3. Graph traversal/7. DFS and BFS in implicit graphs.srt 11.7 KB
~Get Your Files Here !/9. Graph coloring/2. Checking 2-colorability (bipartite graph).srt 11.6 KB
~Get Your Files Here !/4. Topological sort/1. What is topological sort.srt 10.9 KB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/1. What is a Eulerian pathcycle.srt 10.6 KB
~Get Your Files Here !/3. Graph traversal/3. Solution Path exists in a graph.srt 10.5 KB
~Get Your Files Here !/6. Trees/3. Solution All nodes distance k in a tree problem.srt 10.4 KB
~Get Your Files Here !/7. Minimum spanning trees/1. What is a (minimum) spanning tree.srt 10.3 KB
~Get Your Files Here !/2. Graph representation/2. Adjacency matrix representation.srt 9.1 KB
~Get Your Files Here !/1. Introduction/3. Python crash course (optional).html 9.0 KB
~Get Your Files Here !/3. Graph traversal/6. Solution Minimum edges from start to end.srt 8.9 KB
~Get Your Files Here !/5. Shortest path problem/6. Shortest path in unweighted graphs.srt 8.5 KB
~Get Your Files Here !/6. Trees/2. Out-trees (arborescence) and graph to out-tree conversion.srt 7.8 KB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/5. What is a Hamiltonian pathcycle.srt 7.6 KB
~Get Your Files Here !/1. Introduction/1. Introduction to graph theory.srt 7.1 KB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/4. Solution Reconstruct itinerary.srt 6.5 KB
~Get Your Files Here !/5. Shortest path problem/7.3 ShortestPathDAG.java 6.5 KB
~Get Your Files Here !/7. Minimum spanning trees/5. Solution Min cost to connect all points problem.srt 6.3 KB
~Get Your Files Here !/5. Shortest path problem/3.3 BellmanFord.java 5.8 KB
~Get Your Files Here !/2. Graph representation/2.3 GraphAdjMat.java 5.2 KB
~Get Your Files Here !/5. Shortest path problem/1. Introduction.srt 4.4 KB
~Get Your Files Here !/6. Trees/3.2 DistanceK.java 4.2 KB
~Get Your Files Here !/5. Shortest path problem/7.2 shortest_path_dag.py 4.2 KB
~Get Your Files Here !/2. Graph representation/2.2 graph_adj_mat.py 4.0 KB
~Get Your Files Here !/5. Shortest path problem/5.1 Johnson.java 3.9 KB
~Get Your Files Here !/5. Shortest path problem/4.3 FloydWarshall.java 3.8 KB
~Get Your Files Here !/5. Shortest path problem/2.2 Dijkstra.java 3.8 KB
~Get Your Files Here !/7. Minimum spanning trees/3.3 Kruskal.java 3.5 KB
~Get Your Files Here !/7. Minimum spanning trees/2.2 Prim.java 3.5 KB
~Get Your Files Here !/2. Graph representation/1.3 GraphAdjList.java 3.5 KB
~Get Your Files Here !/6. Trees/1.2 IsTree.java 3.5 KB
~Get Your Files Here !/5. Shortest path problem/6.3 ShortestPathUnweighted.java 3.5 KB
~Get Your Files Here !/9. Graph coloring/2.3 TwoColorability.java 3.3 KB
~Get Your Files Here !/5. Shortest path problem/3.2 bellman_ford.py 3.2 KB
~Get Your Files Here !/9. Graph coloring/7.3 SudokuSolver.java 3.2 KB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/4.3 ReconstructItinerary.java 3.0 KB
~Get Your Files Here !/7. Minimum spanning trees/3.5 kruskal.py 2.9 KB
~Get Your Files Here !/6. Trees/3.1 distance_k.py 2.9 KB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/2.1 Hierholzer.java 2.9 KB
~Get Your Files Here !/4. Topological sort/5.3 FindPossibleRecipes.java 2.9 KB
~Get Your Files Here !/3. Graph traversal/1.2 dfs_visualization.py 2.8 KB
~Get Your Files Here !/2. Graph representation/1.2 graph_adj_list.py 2.8 KB
~Get Your Files Here !/1. Introduction/2. [IMPORTANT] Before we start.html 2.8 KB
~Get Your Files Here !/3. Graph traversal/4.1 bfs_visualization.py 2.8 KB
~Get Your Files Here !/9. Graph coloring/3.3 KColorability.java 2.6 KB
~Get Your Files Here !/9. Graph coloring/2.2 two_colorability.py 2.5 KB
~Get Your Files Here !/9. Graph coloring/5.2 DSatur.java 2.4 KB
~Get Your Files Here !/7. Minimum spanning trees/1.2 FindSpanningTree.java 2.4 KB
~Get Your Files Here !/6. Trees/2.3 ToOutTree.java 2.4 KB
~Get Your Files Here !/9. Graph coloring/6. Problem Sudoku solver.html 2.3 KB
~Get Your Files Here !/5. Shortest path problem/5.2 johnson.py 2.3 KB
~Get Your Files Here !/4. Topological sort/2.3 TopsortDfs.java 2.2 KB
~Get Your Files Here !/4. Topological sort/3.3 TopsortBfs.java 2.2 KB
~Get Your Files Here !/5. Shortest path problem/4.2 floyd_warshall.py 2.2 KB
~Get Your Files Here !/3. Graph traversal/4.2 Bfs.java 2.1 KB
~Get Your Files Here !/7. Minimum spanning trees/2.4 prim.py 2.1 KB
~Get Your Files Here !/9. Graph coloring/3.2 k_colorability.py 2.0 KB
~Get Your Files Here !/5. Shortest path problem/2.3 dijkstra.py 2.0 KB
~Get Your Files Here !/4. Topological sort/5.2 find_possible_recipes.py 2.0 KB
~Get Your Files Here !/9. Graph coloring/7.2 sudoku_solver.py 2.0 KB
~Get Your Files Here !/7. Minimum spanning trees/5.3 MinCostConnect.java 1.9 KB
~Get Your Files Here !/9. Graph coloring/5.5 WelshPowell.java 1.9 KB
~Get Your Files Here !/3. Graph traversal/1.3 Dfs.java 1.9 KB
~Get Your Files Here !/6. Trees/1.1 is_tree.py 1.8 KB
~Get Your Files Here !/3. Graph traversal/7.2 BfsGrid.java 1.8 KB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/4.2 reconstruct_itinerary.py 1.8 KB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/6.3 HamiltonianBacktracking.java 1.8 KB
~Get Your Files Here !/9. Graph coloring/4.3 GreedyColoring.java 1.8 KB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/2.3 hierholzer.py 1.7 KB
~Get Your Files Here !/5. Shortest path problem/6.2 shortest_path_unweighted.py 1.7 KB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/3. Problem Reconstruct itinerary.html 1.6 KB
~Get Your Files Here !/7. Minimum spanning trees/1.1 find_spanning_tree.py 1.6 KB
~Get Your Files Here !/3. Graph traversal/7.5 DfsGrid.java 1.6 KB
~Get Your Files Here !/7. Minimum spanning trees/5.2 min_cost_connect.py 1.5 KB
~Get Your Files Here !/3. Graph traversal/3.3 DfsPathExists.java 1.5 KB
~Get Your Files Here !/3. Graph traversal/7.4 dfs_grid.py 1.4 KB
~Get Your Files Here !/3. Graph traversal/7.1 bfs_grid.py 1.4 KB
~Get Your Files Here !/4. Topological sort/4. Problem Find all possible recipes.html 1.4 KB
~Get Your Files Here !/3. Graph traversal/4.3 bfs.py 1.4 KB
~Get Your Files Here !/3. Graph traversal/6.3 BfsMinEdges.java 1.4 KB
~Get Your Files Here !/6. Trees/2.2 to_out_tree.py 1.3 KB
~Get Your Files Here !/4. Topological sort/2.2 topsort_dfs.py 1.3 KB
~Get Your Files Here !/9. Graph coloring/5.3 dsatur.py 1.3 KB
~Get Your Files Here !/3. Graph traversal/2. Problem Path exists in a graph.html 1.3 KB
~Get Your Files Here !/4. Topological sort/3.2 topsort_bfs.py 1.3 KB
~Get Your Files Here !/7. Minimum spanning trees/4. Problem Min cost to connect all points.html 1.3 KB
~Get Your Files Here !/7. Minimum spanning trees/3.2 DisjointSet.java 1.2 KB
~Get Your Files Here !/8. Eulerian and Hamiltonian pathscycles/6.2 hamiltonian_backtracking.py 1.2 KB
~Get Your Files Here !/3. Graph traversal/1.4 dfs.py 1.2 KB
~Get Your Files Here !/3. Graph traversal/3.2 dfs_path_exists.py 1.1 KB
~Get Your Files Here !/3. Graph traversal/6.2 bfs_min_edges.py 1.0 KB
~Get Your Files Here !/9. Graph coloring/5.4 welsh_powell.py 1.0 KB
~Get Your Files Here !/3. Graph traversal/5. Problem Minimum edges from start to end.html 1.0 KB
~Get Your Files Here !/9. Graph coloring/4.2 greedy_coloring.py 1005 bytes
~Get Your Files Here !/5. Shortest path problem/3.4 Edge.java 557 bytes
~Get Your Files Here !/Bonus Resources.txt 386 bytes
~Get Your Files Here !/5. Shortest path problem/2.6 Tuple.java 284 bytes
~Get Your Files Here !/5. Shortest path problem/3.5 Tuple.java 284 bytes
~Get Your Files Here !/7. Minimum spanning trees/2.5 Tuple.java 284 bytes
Get Bonus Downloads Here.url 182 bytes
~Get Your Files Here !/2. Graph representation/4. Quiz Adjacency lists and matrices.html 167 bytes
~Get Your Files Here !/4. Topological sort/6. Quiz Topological sort.html 167 bytes
~Get Your Files Here !/6. Trees/4. Quiz What is a tree.html 167 bytes
~Get Your Files Here !/7. Minimum spanning trees/6. Quiz Minimum spanning trees.html 167 bytes
~Get Your Files Here !/9. Graph coloring/8. Quiz Graph coloring.html 167 bytes
~Get Your Files Here !/3. Graph traversal/7.6 Flood fill algorithm YouTube video.html 104 bytes
~Get Your Files Here !/5. Shortest path problem/2.1 Binary heaps YouTube video.html 104 bytes
~Get Your Files Here !/7. Minimum spanning trees/3.1 Disjoint-set data structure YouTube video.html 104 bytes

[ DevCourseWeb.com ] Udemy - Graph theory algorithms visualized

File List

Download Torrent

Related Resources

Copyright Infringement