| Safe Haskell | None |
|---|
Lab3GUI
Description
Graphical user interface for the path finding assignment.
Documentation
type Name = String
The name of a (tram/bus/…) stop.
type Cost = Integer
The cost of a path, expressed in minutes.
type ShortestPath g = g → Name → Name → Maybe ([Name], Cost)
A function to calculate the shortest path between two stops in a graph
of type g. Returns the list of stops making up that path and the total
cost of the path. Must return Nothing if no path could be found.
Arguments
| ∷ [Stop] | All nodes in the graph. |
| → [LineTable] | All lines. |
| → graph | A value representing the graph. |
| → ShortestPath graph | |
| → IO () |
Launches a travel planner GUI using a custom shortest path implementation. The GUI can be reached at http://localhost:8888.