ShortestPath

constructor(nodes: List<T>, totalCost: Double)