Determines the k shortest simple paths in increasing order of weight.
- A graph represented as a map from vertices (strings) to a list of neighbors (list of strings) OR the url to the Data API file that holds the graph that you would like to be read (currently supported formats: GML)
- Start vertex (string)
- End vertex (string)
- k (int)