Minimum Spanning Trees: Prims Algorithm

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (27)

Page 2 of 3

Dijkstra's Algorithm: All-Pairs

Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.

Minimal Spanning Tree

Covers the concept of weighted graphs and the Greedy algorithm for finding a minimal spanning tree.

Network Flow Algorithms

Covers network flow algorithms, including Max Flow, Min Cut, and Negative Cost Cycle Algorithm, progressing from basic definitions to advanced algorithms like Bellman-Ford and Dijkstra's.

Python Programming: Dictionaries and Classes

Introduces Python programming concepts, focusing on dictionaries and classes, including their definitions, usage, and practical examples.

Coin Rendering: Part 1

Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.

Image Processing Techniques: Seam Carving and Pixel Manipulation

Discusses image processing techniques, focusing on seam carving and pixel manipulation in Python programming.

Algorithms & Growth of Functions

Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.

Solving Parity Games in Practice

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Traveling Salesman Problem: Resolution Algorithms

Explores the Traveling Salesman Problem, resolution algorithms, minimum spanning tree, and shortcut optimization.

C++ Standard Library: Containers and Algorithms

Covers the basics of C++ standard library containers, algorithms, and iterators.