simulation_square: Simulation square
In Faheemah-p/ShortPath: Finding the shortest path of a graph

returns the shortest distance and plot it in a graph

1	simulation_square(graph,algorithm)

`graph`	It returns the distance and the vertices of the shortest path.
`algorithm`	Dijkstra or BellmanFord

1
2
3

graph <- graph(n,nbPaths)
res <- Dijkstra(graph)
simulation_square(res,res$path)

Faheemah-p/ShortPath documentation built on Feb. 3, 2022, 7:20 p.m.

Faheemah-p/ShortPath index

README.md

Note that we can't provide technical support on individual packages. You should contact the package authors for that.

Description