Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
SSQ
GitHub Repository: SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming
Path: blob/master/Programming Assignment 1/README.md
423 views

File Description

  • .txt files are data file.

    • edges.txt with 500 nodes and 2184 edges;

    • jobs.txt with 10,000 jobs

  • .ipynb file is the solution of Week 1 program assignment

    • greedyalgorithm.ipynb

  • .html file is the html version of .ipynb file.

    • greedyalgorithm.html

Snapshot

open .html file via brower for quick look.

Implementation

  • Greedy Algorithm

  • Prim's Minimum Spanning Tree