Skip to first unread message
oj
Feb 1, 2016, 7:33:30 PM2/1/16
to Sparksee
Hi,
I noticed there are two versions of the shortest path algorithm implemented in Sparksee.
Can you please explain what the algorithm is like for SinglePairShortestPathBFS? The manual says it uses a breadth first search strategy, but is it like a bidirectional search from source and destination nodes?
Thanks much!
c3po.ac
Feb 2, 2016, 4:28:30 AM2/2/16
to Sparksee
Hi,
Prior to the Sparksee 5.2 release the SinglePairShortestPathBFS implementation was a very basic BFS (breadth first search) starting only from the source node, thus the explanation you found on the manual. For the 5.2 we updated it, now starting from both sides (source and destinatin nodes) to be able to expand from each side.
Hope this helps!
El dimarts, 2 febrer de 2016 1:33:30 UTC+1, oj va escriure:
Prior to the Sparksee 5.2 release the SinglePairShortestPathBFS implementation was a very basic BFS (breadth first search) starting only from the source node, thus the explanation you found on the manual. For the 5.2 we updated it, now starting from both sides (source and destinatin nodes) to be able to expand from each side.
Hope this helps!
El dimarts, 2 febrer de 2016 1:33:30 UTC+1, oj va escriure:
Reply all
Reply to author
Forward
0 new messages