Lab Assignment 3
This lab task contains a package named eucdij, containing:
- Finds Euclidian Distance between two numeric scalers or integers.
Shortest Path (Dijkstra Algorithm):
- Finds the shortest path from initial vertex to other vertexes
- Dataset from wiki graph
eucdij does not depend on any other package and is very easy to use
Install the package using:
After installation, load the package using:
You can access help for the function using "?" follwed by function name, e.g:
This repo is still under development, we hope to add more features to it.