Commits on Dec 3, 2020

1. Add support for shortest_path_length and fix graph vertex checks(#1278) …

   Adds the ability to get the length/cost of path from source to destination(s). Closely follows [`networkx.shortest_path_length`](https://networkx.org/documentation/latest/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.shortest_path_length.html#networkx.algorithms.shortest_paths.generic.shortest_path_length). 
   
   
   Similarities:
   1) Takes an optional target vertex
   2) If only source is provided, a `cudf` dataframe is returned with columns: `[vertex, distance]` (similar to `networkx` dictionary return)
   3) If source and target are specified the exact length is returned or `sys.float_info.max` if the vertex is not reachable. 
   
   
   Differences:
   1) Requires that source be provided, as apposed to `networkx`
   2) Nethod of graph traversal is not an option. 
   
   Fixes:
   1) Fixes #806 
   2) `sssp` and `cugraph.Graph.has_node` vertex checks. Added support for checking for vertexes that are not apart of the graph. in the past, `TypeError` was raised when doing a comparison check (as apposed to `ValueError`)
   
   Authors:
     - John Purviance <jsgpurviance@gmail.com>
     - BradReesWork <BradReesWork@users.noreply.github.com>
   
   Approvers:
     - Alex Fender
   
   URL: #1278

   

   jpurviance authored Dec 3, 2020
   Configuration menu

   • View commit details
   • Copy full SHA for 6b92349
   • Browse repository at this point

   Copy the full SHA

   6b92349 View commit details

   Browse the repository at this point in the history