Dijkstra: Dijkstra Function
In zahrajalilpour292/first_package: It calculates the greatest common divisor of two numbers

This is greedy algorithm, which finds the shortest path in graph from the given node.

1	dijkstra(graph, init_node)

`graph`	is a data frame with 3 columns , v1 ,v2 and w
`init_node`	is a atomic numeric value, which reprent the node in the graph

It returns the numeric vector of shortest path from given node to all other nodes.

"https://en.wikipedia.org/wiki/Dijkstra

zahrajalilpour292/first_package documentation built on Oct. 4, 2020, 2:24 a.m.

zahrajalilpour292/first_package index

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

Description