This is an efficient implementation of Dijkstra's algorithm using a Linked List and a Priority Queue (Binary Heap). Unlike most other path finding implementations found in PSC, this application maintains a topological structure to store and navigate throu ...(description truncated)(ScreenShot)
The process of generalization is normally executed when the map scale has to be reduced. Another usage is in cleaning up noisy representations of polylines, possibly generated by a raster-to-vector conversion (tracing).
Generalization can be seen as a for ...(description truncated)(ScreenShot)
Simple Implementation of Prim's Algorithm for computing a Minimum Spanning Tree (MST). The GUI is ideal for demonstration purposes.
The MST is useful for efficiently solving some network design problems. An example might be a cable TV company laying cable ...(description truncated)(ScreenShot)
My nonprogramming sites: The Real Estate Crowdfunding Review: Investing tools that cut through the clutter and the hype.
Real information and reviews. Real-time investment feeds. Real profitable. | Dollar candy: Play 60 second puzzles against three other people for real money! Legal in 36 states and overseas.