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 3/README.md
423 views

File Description

  • .txt files are data file.

    • huffman.txt with 1000 symbols

    • mwis.txtwith 1000 vertices

  • .ipynb file is the solution of Week 3 programming assignment

    • HuffmanCoding.ipynb

    • DynamicProgramming.ipynb

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

    • HuffmanCoding.html

    • DynamicProgramming.html

Snapshot

open .html file via brower for quick look.

Implementation

  • Huffman coding with Greedy Algorithm

  • Dynamic programming algorithm for computing a maximum-weight independent set of a path graph