Udemy - Mastering Algorithms - Efficient Problem Solving

  • Category Other
  • Type Tutorials
  • Language English
  • Total size 441.1 MB
  • Uploaded By freecoursewb
  • Downloads 312
  • Last checked 1 month ago
  • Date uploaded 2 years ago
  • Seeders 10
  • Leechers 3

Infohash : BEFD267D898E706B52E6ECC3A1F5A1F13C72C376



Mastering Algorithms: Efficient Problem Solving



https://DevCourseWeb.com

Published 6/2023
MP4 | Video: h264, 1280x720 | Audio: AAC, 44.1 KHz
Language: English | Size: 441.09 MB | Duration: 0h 38m

Unlocking the Power of Data Structures and Algorithms for Faster, More Efficient Solutions

What you'll learn
Understand the fundamental concepts of graph theory, including types of graphs, vertices, edges, and paths.
Analyze and implement depth-first search and breadth-first search algorithms for traversing and exploring graphs.
Compute the shortest path between two vertices in a graph using Dijkstra's algorithm and understand its implementation and complexity.
Identify strongly connected components and compute topological order in directed graphs, and understand the algorithms used for these computations.

Requirements
Learners should have access to a computer with a reliable internet connection and a web browser to access course materials and complete programming assignments.

Files:

[ DevCourseWeb.com ] Udemy - Mastering Algorithms - Efficient Problem Solving
  • Get Bonus Downloads Here.url (0.2 KB)
  • ~Get Your Files Here ! 1 - Introduction
    • 1 - Introduction.mp4 (6.8 MB)
    10 - Discovering Strongly Connected Components Algorithms and Analysis
    • 10 - Strongly Connected Components.mp4 (24.1 MB)
    11 - Mastering Single Source Shortest Paths Algorithms and Applications
    • 11 - Single Source Shortest Paths.mp4 (34.0 MB)
    12 - Checkpoint
    • 12 - Conclusion.mp4 (2.8 MB)
    13 - Finding the Critical Path in a Project Schedule using Shortest Paths in DAGs
    • 13 - Shortest Paths in Graphs.mp4 (34.4 MB)
    14 - Cracking the Code An Introduction to Huffman Encoding
    • 14 - Huffman Encoding.mp4 (56.6 MB)
    15 - Optimizing Resource Allocation with Set Covers A Greedy Algorithm Approach
    • 15 - Set Covers.mp4 (27.5 MB)
    2 - Exploring Graphs with DepthFirst Search DFS
    • 2 - DFS.mp4 (19.0 MB)
    3 - Breadth First Search BFS
    • 3 - BFS.mp4 (54.2 MB)
    4 - Exploring Graph Algorithms An Introduction to Graph Theory
    • 4 - Distances.mp4 (11.1 MB)
    5 - Navigating Graphs with Edge Lengths Strategies and Techniques
    • 5 - Lengths on Edges.mp4 (54.3 MB)
    6 - Uncovering Structure with Strongly Connected
    • 6 - SCCs.mp4 (24.1 MB)
    7 - Efficiently Solving Pathfinding Problems
    • 7 - Priority Queues.mp4 (33.7 MB)
    8 - Exploring Graph Theory Solving the Shortest Path Without Cycles Problem
    • 8 - Shortest Paths in the Presence of Negative Edges.mp4 (28.0 MB)
    9 - Unraveling Topological Ordering Theory and Practice
    • 9 - Topological Ordering.mp4 (30.3 MB)
    • Bonus Resources.txt (0.4 KB)

There are currently no comments. Feel free to leave one :)

Code:

  • udp://tracker.torrent.eu.org:451/announce
  • udp://tracker.tiny-vps.com:6969/announce
  • http://tracker.foreverpirates.co:80/announce
  • udp://tracker.cyberia.is:6969/announce
  • udp://exodus.desync.com:6969/announce
  • udp://explodie.org:6969/announce
  • udp://tracker.opentrackr.org:1337/announce
  • udp://9.rarbg.to:2780/announce
  • udp://tracker.internetwarriors.net:1337/announce
  • udp://ipv4.tracker.harry.lu:80/announce
  • udp://open.stealth.si:80/announce
  • udp://9.rarbg.to:2900/announce
  • udp://9.rarbg.me:2720/announce
  • udp://opentor.org:2710/announce
REVERSE-PROXY 🔄 RP (success) | 4421ms 📄 torrent 🕐 18 Jan 2026, 05:41:26 am IST ⏰ 12 Feb 2026, 05:41:26 am IST ✅ Valid for 24d 23h 🔄 Wait 10m