Discrete mathematics MATLAB
Budget: $10 – $30 USD
Task. Choose any (good) map and on its basis create in MATLAB
graph with direct road connections between voivodeship capital cities in Poland.
Create:
* edge matrix (sparse matrix: 0 when no connection when there is connection t
weight w)
* matrix of node names - city names
* edge name matrix - road names (e.g. A4, S8, E65)
* graph drawing (add road names in edge labels to a standard drawing)
Works:
* Find the shortest routes between different cities
* Check which routes will be offered by the selected navigation
* Add MATLAB interface for starting and ending city selection
graph with direct road connections between voivodeship capital cities in Poland.
Create:
* edge matrix (sparse matrix: 0 when no connection when there is connection t
weight w)
* matrix of node names - city names
* edge name matrix - road names (e.g. A4, S8, E65)
* graph drawing (add road names in edge labels to a standard drawing)
Works:
* Find the shortest routes between different cities
* Check which routes will be offered by the selected navigation
* Add MATLAB interface for starting and ending city selection