Preview
Description
Prim’s Algorithm is one of the most important algorithms for constructing minimum spanning trees. Receive instant feedback and explanations in practice mode. Test your accuracy and speed by tackling the challenging questions in test mode. Prim’s Algorithm is an algorithm to find a minimum spanning tree (MST) for a connected weighted graph. That is, it finds a tree which includes every vertex where the total weight of all the edges in the tree is minimised. A single graph may have more than one minimum spanning tree. Prim’s is a standard algorithm in A-level decision maths (D1) courses run by AQA, OCR, MEI and Edexcel.
What's New
Version 1.1.0 2014-05-02
iOS 7 support Technical Analysis
Package Overview Basic metadata
Bundle ID
com.appmattus.decision.prims Current Version 1.1.0
Minimum iOS 7.0
Package Size App Store Size
Package Metadata 1 / 2 version records
Detailed binary, privacy manifest, framework, and Info.plist results have not been indexed for this package yet. The verified App Store and archive metadata above remains available.
Developer Information
Known Version Records
1 version record with stored package metadata • 2 known version records
Stored metadata does not guarantee a package is currently available to download.
| Details | Version / IDs | Version date | Action |
|---|---|---|---|
| 4.14 MB | v1.1.0 App Store ID: 565104082Build: 1.1.0 | 2014-05-02 08:33:07 | Paid / Arcade |
| Not archived | App Store ID: 13261646 | Unknown | Paid / Arcade |