Solution: Heapq methods practice - Python Tutorial

Contents

• Introduction Introduction

  • Python data structures and algorithms in action

    1m 4s
  • What you should know

    35s
• 1. Pathfinding Algorithms in a Maze Game 1. Pathfinding Algorithms in a Maze Game

  • Understand the example application

    6m 28s
  • (Locked)
    Navigate the GUI

    3m 8s
• 2. The Stack Data Structure 2. The Stack Data Structure

  • Understand the stack data structure

    2m 1s
  • (Locked)
    Build a stack class in Python

    13m
  • (Locked)
    Solution: Reverse a string using a stack

    2m 22s
• 3. The 2D List Data Structure 3. The 2D List Data Structure

  • (Locked)
    Understand the 2D list data structure

    1m 44s
  • (Locked)
    Represent a maze as a 2D list

    4m 15s
  • (Locked)
    Read a maze from a text file

    4m 54s
  • (Locked)
    Challenge: Read and display a maze from a text file

    34s
  • (Locked)
    Solution: Read and display a maze from a text file

    1m 14s
• 4. Depth-First Search Algorithm 4. Depth-First Search Algorithm

  • (Locked)
    Understand the depth-first search algorithm

    3m 28s
  • (Locked)
    Visualize depth-first search on a grid

    5m 21s
  • (Locked)
    Use the Grid Tracer app

    2m 35s
  • (Locked)
    Code a depth-first search in Python

    12m 10s
  • (Locked)
    Challenge: Trace the path of a depth-first search

    44s
  • (Locked)
    Solution: Trace the path of a depth-first search

    34s
• 5. The Queue Data Structure 5. The Queue Data Structure

  • (Locked)
    Understand the queue data structure

    2m 20s
  • (Locked)
    Build a queue class in Python

    9m 25s
  • (Locked)
    Solution: Practice queue methods

    2m 57s
• 6. The Breadth-First Search Algorithm 6. The Breadth-First Search Algorithm

  • (Locked)
    Understand the breadth-first search algorithm

    3m 1s
  • (Locked)
    Visualize breadth-first search in a grid

    5m 10s
  • (Locked)
    Code a breadth-first search in Python

    6m 39s
  • (Locked)
    Challenge: Trace the path of a breadth-first search

    30s
  • (Locked)
    Solution: Trace the path of a breadth-first search

    37s
• 7. The Priority Queue Data Structure 7. The Priority Queue Data Structure

  • (Locked)
    Understand the priority queue data structure

    1m 20s
  • (Locked)
    Use the heap module to implement a priority queue

    7m 39s
  • (Locked)
    Solution: Heapq methods practice

    2m 29s
• 8. The A* Search Algorithm 8. The A* Search Algorithm

  • (Locked)
    Understand the A* search algorithm

    4m 41s
  • (Locked)
    Visualize the A* algorithm

    10m 50s
  • (Locked)
    Code the A* algorithm in Python

    8m 1s
  • (Locked)
    Challenge: Trace the path of an A* search

    50s
  • (Locked)
    Solution: Trace the path of an A* search

    1m 34s
• Conclusion Conclusion

  • (Locked)
    Pathfinding algorithms in the course maze GUI

    3m 28s
  • (Locked)
    Parting comments and what comes next

    1m 34s