Implement an algorithm called CountShortestPaths
that counts the number of shortests paths between two vertices in an
unweighted graph.
Use the
Algoraph Plugin
(which should already be installed on the lab machines) and upload your algorithm so you can test it on some graphs.
Your algorithm should extend BreadthFirstSearchSkeletonAlgorithm.
The getResult method should return just the number of paths from the
first vertex in the graph to the last one. BFS will automatically run starting
at the first vertex.
I will look at your algorithms in Algoraph so all you need to do is make sure your algorithm is uploaded.