MyPage is a personalized page based on your interests.The page is customized to help you to find content that matters you the most.

I'm not curious

Working with Graph Algorithms in Python

Course Summary

This course focuses on how to represent a graph using three common classes of graph algorithms - the topological sort to sort vertices by precedence relationships, the shortest path algorithm, and finally the spanning tree algorithms.

  • +

    Course Syllabus

    Course Overview
    - 1m 58s

    —Course Overview 1m 58s
    Introducing the Graph Data Structure
    - 49m 55s

    —Pre-requisites and Course Overview 2m 40s
    —Modeling Relationships Using Graphs 4m 12s
    —Directed and Undirected Graphs 1m 43s
    —Undirected Graphs, Trees, and Forests 4m 16s
    —Directed Graphs and Precedence Relationships 3m 9s
    —The Adjacency Matrix 3m 6s
    —Demo: Representing a Graph as an Adjacency Matrix 8m 26s
    —The Adjacency List and the Adjacency Set 3m 17s
    —Demo: Representing a Graph as an Adjacency Set 3m 53s
    —Comparing Graph Data Structures 3m 28s
    —Breadth-first and Depth-first Graph Traversal 5m 5s
    —Demo: Implementing Breadth-first Traversal in Python 3m 17s
    —Demo: Implementing Depth-first Traversal in Python 3m 19s
    Understanding Topological Sort
    - 19m 7s
    Working with Shortest Path Algorithms
    - 37m 43s
    Working with Spanning Tree Algorithms
    - 25m 35s

Course Fee:
USD 29

Course Type:


Course Status:



1 - 4 hours / week

This course is listed under Open Source , Development & Implementations and Data & Information Management Community

Related Posts:



Data structure


Attended this course?

Back to Top

Awards & Accolades for MyTechLogy
Winner of
Top 100 Asia
Finalist at SiTF Awards 2014 under the category Best Social & Community Product
Finalist at HR Vendor of the Year 2015 Awards under the category Best Learning Management System
Finalist at HR Vendor of the Year 2015 Awards under the category Best Talent Management Software
Hidden Image Url