GPS download | SourceForge.net

A GPS simulator created in java. It contains a graphical interface and the shortest path will be found using Dijkstra algorithm

Project Activity

See All Activity >

Follow GPS

GPS Web Site

Other Useful Business Software

$300 Free Credits to Build on Google Cloud

New customers can spin up VMs, build with AI, and query data at no cost.

Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.

Start Free

Rate This Project

User Reviews

Be the first to post a review of GPS!

Additional Project Details

Registered

2009-11-09

Report inappropriate content

$300 Free Credits to Build on Google Cloud

New customers can spin up VMs, build with AI, and query data at no cost.

Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.

Start Free

Recommended Projects

Dijkstra shortest path algorithm
Simple Dijkstra shortest path implementation - for learning and teaching
GPS Simulator
The GPS Simulator simulates a GPS receiver which emits NMEA sentences over Bluetooth. It can be used to test location based applications on real mobile devices, in particular on mobile devices which have a JSR 179 implementation based on a connected GPS.
gps_chung
gps chung is an open source GPS algorythm program. It calculates the shortest way path from start to end out of an array of road segments (position, direction) . Source code gps_chung.bi is included as example in a small application game garden_chung (freebasic) lite version of circuit_chung road circuit game with random map generation , home garden edit and gps speech voices.
Dijkstra
A Java implementation of the Dijkstra bestpath algorithm.
Grapho
A educational Java software featuring a graph editor and algorithms animation to learn how the algorithms work. Algorithms: Breadth First Search (BFS), Depth First Search (DFS), Minimum Spanning Tree (Prim), Single-Source Shortest Path (Dijkstra), Maximum Flow (Edmonds-Karp).