ShortestDistance Command

ShortestDistance( <List of Segments>, <Start Point>, <End Point>, <Boolean Weighted> ): Finds shortest path between start point and endpoint in a graph given by list of segments. If weighted is false, weight of each edge is supposed to be 1 (i.e. we are looking for the path with least number of edges), otherwise it is the length of given segment (we are looking for the geometrically shortest path).