Shortest path implementation

[adfeel220]

Shortest Path

Updates

• The shortest path algorithm is supported with directed and undirected graphs
  • The return type is a vector of vertices as its path
• Current implementation only works when the source and destination are specified.

Testing

• The test script creates a random graph, selecting source and destination vertices, and compares the shortest path obtained by Graphs.dijkstra_shortest_path and this result.

[codecov]

Codecov Report

Merging #17 (0860342) into main (ccaf5ad) will increase coverage by 1.05%.
The diff coverage is 100.00%.

@@             Coverage Diff             @@
##             main       #17      +/-   ##
===========================================
+ Coverage   98.94%   100.00%   +1.05%     
===========================================
  Files           5         6       +1     
  Lines          95       124      +29     
===========================================
+ Hits           94       124      +30     
+ Misses          1         0       -1     

Files	Coverage Δ
src/GraphsOptim.jl	100.00% <ø> (ø)
src/flow.jl	100.00% <100.00%> (+2.94%)	⬆️
src/shortest_path.jl	100.00% <100.00%> (ø)

[gdalle]

Just merged main into your branch, that way we should see the docs at https://juliagraphs.org/GraphsOptim.jl/previews/PR17

EDIT: crap, we can't because you pushed from a fork