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

File Description

  • .txt files are data file.

    • clustering1.txt with 500 nodes

    • clustering_big.txt with 200,000 positions

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

    • Cluster 1.ipynb for Kruskal's MST algorithm (clustering)

    • Cluster 2.ipynb for Clustering

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

    • Cluster 1.html

    • Cluster 2.html

Note: Algorithms in clusteringtest. file is written by dmitri-tinyco

Snapshot

open .html file via brower for quick look.

Implementation

  • Kruskal's MST algorithm

  • Clustering