Handler.calP(source,target)

Return the shortest from source to target in a weighted graph G.

  1. Parameters
  2. - source: node
  3. - - starting node
  4. - target: node
  5. - - Ending node
  6. - weight: string,optional(default='weight')
  7. Return: path: list
  8. - - List of nodes in a shortest path.
  9. Raises: NoPath: if no path exists between source and target, return null.
  10. Related function:

http://networkx.github.io/documentation/latest/reference/generated/networkx.algorithms.shortest_paths.weighted.dijkstra_path.html#networkx.algorithms.shortest_paths.weighted.dijkstra_path

 
projs/clans/docs/sps/handler.calp_source_target.txt · Last modified: 2014/01/21 15:22 by yoyoliliu     Back to top