Another exquisit release
Pluralsight.Working.with.Graph.Algorithms.in.Python-XQZT
Title: Working with Graph Algorithms in Python
Publisher: Pluralsight
Iso Size: 219M (228405248 B)
Files: 5F
Date: 07/21/2017
Course #: Pluralsight
Type: software-development data-professional
Published: Thu Jul 20, 2017
Modified: July 20, 2017
URL: www.pluralsight.com/courses/graph-algorithms-python
Author: Janani Ravi
Duration: 2h 10m
Skill: Beginner
Exercise: [ ]
Installation:
Unpack that shit, mount that shit, run that shit
Notes:
A graph is the underlying data structure behind social
networks, maps, routing networks and logistics, and a whole range of
applications that you commonly use today. In this course,
Working with Graph Algorithms in Python, you'll learn
different kinds of graphs, their use cases, and how
they're represented in code. First, you'll dive into
understanding the pros and cons of adjacency matrices,
adjacency lists, adjacency sets, and know when you would choose one
data structure over another. Next, you'll explore common
graph algorithms, such as the topological sort, used to model
dependencies in tasks, build components, and manage projects.
Additionally, you'll cover how to find the shortest path in a
graph, the core algorithm for mapping technologies. Lastly,
you'll be introduced to spanning tree algorithms, which are
used to find a path and covers all nodes with minimum cost, the
fundamental algorithm behind figuring flight paths, and bus
routes. By the end of this course, you'll have a better
understanding of these principles and the necessary skills to
implement them into simple, easy to follow Python code.