Pluralsight - Working with Graph Algorithms in Python

  • CategoryOther
  • TypeTutorials
  • LanguageEnglish
  • Total size217.4 MB
  • Uploaded ByMRZOPR
  • Downloads804
  • Last checkedMay. 21st '18
  • Date uploadedAug. 24th '17
  • Seeders 4
  • Leechers0

Infohash : 09C3DA2C634D952E6F399FD8114A5E84D6F3410A

Pluralsight - Working with Graph Algorithms in Python

Code:


Title: Working with Graph Algorithms in Python
Publisher: 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

Files:

Pluralsight - Working with Graph Algorithms in Python 1. Course Overview
  • 01. Course Overview.mp4 (3.6 MB)
2. Introducing the Graph Data Structure
  • 08. Demo - Representing a Graph as an Adjacency Matrix.mp4 (17.4 MB)
  • 10. Demo - Representing a Graph as an Adjacency Set.mp4 (10.1 MB)
  • 03. Modeling Relationships Using Graphs.mp4 (6.8 MB)
  • 12. Breadth-first and Depth-first Graph Traversal.mp4 (6.7 MB)
  • 05. Undirected Graphs, Trees, and Forests.mp4 (5.5 MB)
  • 14. Demo - Implementing Depth-first Traversal in Python.mp4 (5.5 MB)
  • 13. Demo - Implementing Breadth-first Traversal in Python.mp4 (5.3 MB)
  • 11. Comparing Graph Data Structures.mp4 (5.1 MB)
  • 09. The Adjacency List and the Adjacency Set.mp4 (5.0 MB)
  • 07. The Adjacency Matrix.mp4 (4.9 MB)
  • 06. Directed Graphs and Precedence Relationships.mp4 (4.4 MB)
  • 02. Pre-requisites and Course Overview.mp4 (4.1 MB)
  • 04. Directed and Undirected Graphs.mp4 (2.5 MB)
3. Understanding Topological Sort
  • 19. Demo - Implementing Toplogical Sort in Python.mp4 (7.6 MB)
  • 18. Understanding the Toplogical Sort Implementation.mp4 (7.5 MB)
  • 16. Representing Dependencies with the Directed Acyclic Graph.mp4 (7.2 MB)
  • 15. Maintaining Precedence Relationships with Topological Sort.mp4 (4.1 MB)
  • 17. The Toplogical Sort Algorithm.mp4 (3.3 MB)
4. Working with Shortest Path Algorithms
  • 27. Demo - Implementing Dijkstra's Algorithm in Python.mp4 (14.8 MB)
  • 24. Demo - Implementing the Unweighted Shortest Path Algorithm in Python.mp4 (12.7 MB)
  • 26. Building the Distance Table in Dijkstra's Algorithm.mp4 (9.7 MB)
  • 23. Building the Distance Table.mp4 (7.0 MB)
  • 22. Backtracking Using the Distance Table.mp4 (7.0 MB)
  • 25. Understanding Dijkstra's Algorithm.mp4 (4.5 MB)
  • 20. What Is the Shortest Path Between Two Nodes.mp4 (2.8 MB)
  • 21. Unweighted and Weighted Graphs.mp4 (123.0 KB)
5. Working with Spanning Tree Algorithms
  • 33. Demo - Implementing Kruskal's Algorithm in Python.mp4 (12.3 MB)
  • 31. Demo - Implementing Prim's Algorithm in Python.mp4 (10.3 MB)
  • 32. Understanding Kruskal's Algorithm to Generate a Minimum Spanning Tree.mp4 (7.3 MB)
  • 30. Understanding Prim's Algorithm to Generate a Minimum Spanning Tree.mp4 (6.8 MB)
  • 29. Understanding the Minimum Spanning Tree.mp4 (3.3 MB)
  • 28. Introducing Spanning Tree Algorithms.mp4 (2.3 MB)
  • Torrent downloaded from bt-scene.cc.txt (0.3 KB)

Code:

  • udp://tracker.openbittorrent.com:80/announce
  • udp://tracker.publicbt.com:80/announce