dijkstra: Dijkstra's Algorithm
In faridmusayev/R_Lab03: Euclidean and Dijkstra Algorithms

dijkstra takes a graph and an initial node and calculates the shortest path from the initial node to every other node in the graph.

1	dijkstra(graph, init_node)

`graph`	Must be a data frame with three variables (v1, v2, w)
`init_node`	Must be numeric scalar or integer

The shortest path from the initial node to every other node

1 2	dijkstra(wiki_graph, 1) dijkstra(wiki_graph, 3)

faridmusayev/R_Lab03 documentation built on Dec. 20, 2021, 7:44 a.m.

faridmusayev/R_Lab03 index

README.md

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

Description