Graph theory algorithms visualized

سرفصل های دوره

Unleash the power of graph theory with cutting-edge algorithms

1. Introduction

1.1 introduction.pptx

1. Introduction to graph theory

2. [IMPORTANT] Before we start.html

3. Python crash course (optional).html

4.1 types and terms.pptx

4. Terminology and types of graphs

2. Graph representation

1.1 adjacency list.pptx

1.2 graph adj list.zip

1.3 graphadjlist.zip

1. Adjacency list representation

2.1 adjacency matrix.pptx

2.2 graph adj mat.zip

2.3 graphadjmat.zip

2. Adjacency matrix representation

3.1 adj list vs adj mat.pptx

3. Adjacency list vs adjacency matrix

4. Quiz Adjacency lists and matrices.html

3. Graph traversal

1.1 depth-first search.pptx

1.2 dfs visualization.zip

1.3 dfs.zip

1.4 dfs.zip

1. Depth-first search (DFS) algorithm

2. Problem Path exists in a graph.html

3.1 dfs path exists.pptx

3.2 dfs path exists.zip

3.3 dfspathexists.zip

3. Solution Path exists in a graph

4.1 bfs visualization.zip

4.2 bfs.zip

4.3 bfs.zip

4.4 breadth first search.pptx

4. Breadth-first search (BFS) algorithm

5. Problem Minimum edges from start to end.html

6.1 bfs path exists.pptx

6.2 bfs min edges.zip

6.3 bfsminedges.zip

6. Solution Minimum edges from start to end

7.1 bfs grid.zip

7.2 bfsgrid.zip

7.3 dfs and bfs in hidden.pptx

7.4 dfs grid.zip

7.5 dfsgrid.zip

7.6 Flood fill algorithm YouTube video.html

7. DFS and BFS in implicit graphs

4. Topological sort

1.1 topological sort intro.pptx

1. What is topological sort

2.1 topological sort dfs.pptx

2.2 topsort dfs.zip

2.3 topsortdfs.zip

2. DFS-based topological sort algorithm

3.1 topological sort bfs.pptx

3.2 topsort bfs.zip

3.3 topsortbfs.zip

3. BFS-based topological sort algorithm (Kahns algorithm)

4. Problem Find all possible recipes.html

5.1 find recipes.pptx

5.2 find possible recipes.zip

5.3 findpossiblerecipes.zip

5. Solution Find all possible recipes problem

6. Quiz Topological sort.html

5. Shortest path problem

1.1 shortest path intro.pptx

1. Introduction

2.1 Binary heaps YouTube video.html

2.2 dijkstra.zip

2.3 dijkstra.zip

2.4 dijkstras algorithm.pptx

2.5 fibonacciheap.zip

2.6 tuple.zip

2. Dijkstras algorithm

3.1 bellman ford.pptx

3.2 bellman ford.zip

3.3 bellmanford.zip

3.4 edge.zip

3.5 tuple.zip

3. Bellman-Ford algorithm

4.1 floyd warshall.pptx

4.2 floyd warshall.zip

4.3 floydwarshall.zip

4. Floyd-Warshall algorithm

5.1 johnson.zip

5.2 johnson.zip

5.3 johnsons.pptx

5. Johnsons algorithm

6.1 shortest path with unweighted graphs.pptx

6.2 shortest path unweighted.zip

6.3 shortestpathunweighted.zip

6. Shortest path in unweighted graphs

7.1 dag shortest path.pptx

7.2 shortest path dag.zip

7.3 shortestpathdag.zip

7. Shortest path in directed acyclic graphs

6. Trees

1.1 is tree.zip

1.2 istree.zip

1.3 trees introduction.pptx

1. What is a tree

2.1 graph to out-tree.pptx

2.2 to out tree.zip

2.3 toouttree.zip

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

3.1 distance k.zip

3.2 distancek.zip

3.3 nodes at a distance k.pptx

3. Solution All nodes distance k in a tree problem

4. Quiz What is a tree.html

7. Minimum spanning trees

1.1 find spanning tree.zip

1.2 findspanningtree.zip

1.3 mst-intro.pptx

1. What is a (minimum) spanning tree

2.1 fibonacciheap.zip

2.2 prim.zip

2.3 prim.pptx

2.4 prim.zip

2.5 tuple.zip

2. Prims algorithm

3.1 Disjoint-set data structure YouTube video.html

3.2 disjointset.zip

3.3 kruskal.zip

3.4 kruskal.pptx

3.5 kruskal.zip

3. Kruskals algorithm

4. Problem Min cost to connect all points.html

5.1 min cost to connect all points.pptx

5.2 min cost connect.zip

5.3 mincostconnect.zip

5. Solution Min cost to connect all points problem

6. Quiz Minimum spanning trees.html

8. Eulerian and Hamiltonian pathscycles

1.1 eulerian trail intro.pptx

1. What is a Eulerian pathcycle

2.1 hierholzer.zip

2.2 hierholzer.pptx

2.3 hierholzer.zip

2. Hierholzers algorithm

3. Problem Reconstruct itinerary.html

4.1 reconstruct itinerary.pptx

4.2 reconstruct itinerary.zip

4.3 reconstructitinerary.zip

4. Solution Reconstruct itinerary

5.1 hamiltonian paths.pptx

5. What is a Hamiltonian pathcycle

6.1 hamiltonian backtracking.pptx

6.2 hamiltonian backtracking.zip

6.3 hamiltonianbacktracking.zip

6. Hamiltonian pathcycle finding algorithms

9. Graph coloring

1.1 graph coloring.pptx

1. Introduction to graph coloring

2.1 is bipartite.pptx

2.2 two colorability.zip

2.3 twocolorability.zip

2. Checking 2-colorability (bipartite graph)

3.1 k colorability.pptx

3.2 k colorability.zip

3.3 kcolorability.zip

3. Checking k-colorability with backtracking

4.1 greedy coloring.pptx

4.2 greedy coloring.zip

4.3 greedycoloring.zip

4. Greedy coloring

5.1 coloring heuristics.pptx

5.2 dsatur.zip

5.3 dsatur.zip

5.4 welsh powell.zip

5.5 welshpowell.zip

5. Heuristics (Welsh-Powell, DSatur)

6. Problem Sudoku solver.html

7.1 sudoku coloring.pptx

7.2 sudoku solver.zip

7.3 sudokusolver.zip

7. Solution Lets make a Sudoku solver

8. Quiz Graph coloring.html

45,900 تومان

خرید اشتراک افزودن به سبد خرید

خرید دانلودی فوری

در این روش نیاز به افزودن محصول به سبد خرید و تکمیل اطلاعات نیست و شما پس از وارد کردن ایمیل خود و طی کردن مراحل پرداخت لینک های دریافت محصولات را در ایمیل خود دریافت خواهید کرد.

تولید کننده: Udemy-Training