Dijkstra-Tocky Pathfinding

This function identifies paths within a Tocky Network using Dijkstra-Tocky Pathfinding

Usage

DijkstraTockyPath(x, origin_node, destination_node, verbose = TRUE)

Arguments

x

A TockyPrepData containing the network and relevant data.

origin_node

The starting node (cluster) for the path.

destination_node

The ending node (cluster) for the path.

verbose

Logical indicating whether to print progress messages and outputs.

Value

The original TockyPrepData is returned with an additional list attached containing the ordered paths and the closest path.

Details

The function computes mean TimerAngles for each cluster, identifies all possible increasing paths from the origin to the destination, and then calculates the total weight for each path to find the closest one. Paths are determined by increasing TimerAngle values, ensuring that each step along a path moves to a node with a higher TimerAngle.

Examples

if (FALSE) { # \dontrun{
x <- DijkstraTockyPath(x, origin_node = '3', destination_node = '21')
} # }