This is an old revision of the document!
Handler.calP(source,target)
Return the shortest from source to target in a weighted graph G.
- Parameters
- - source: node
- - - starting node
- - target: node
- - - Ending node
- - weight: string,optional(default='weight')
- Return: path: list
- - - List of nodes in a shortest path.
- Raises: NoPath: if no path exists between source and target, return null.
