dijkstra: Dijkstra's algorithm is an algorithm for finding the shortest...

In uzairjan/AdvancedRHT2021_Lab03: this package do has two alogrithem code which could be usefull for find the GCD and short possible path

Description

Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks.

Usage

dijkstra(graph, init_node)

Arguments

graph	graph
init_node	starting node

Value

it return the shortest node every node from the initial node

Examples

wiki_graph <-
data.frame(v1=c(1,1,1,2,2,2,3,3,3,3,4,4,4,5,5,6,6,6),
           v2=c(2,3,6,1,3,4,1,2,4,6,2,3,5,4,6,1,3,5),
           w=c(7,9,14,7,10,15,9,10,11,2,15,11,6,6,9,14,2,9))
dijkstra(wiki_graph, 1)
dijkstra(wiki_graph, 3)

uzairjan/AdvancedRHT2021_Lab03 documentation built on Dec. 23, 2021, 2:06 p.m.