locationgamer (version 0.1.0)

plotDijkstra: Plot shortest path between two points in a network

Description

This function plots the entire network and shortest path between two points. The parameter dijkstraPath is obtained by the function dijkstra, in which one has to specify the initial and end node of the path.

Usage

plotDijkstra(edgeMatrix, coordMatrix, dijkstraPath)

Arguments

edgeMatrix

A matrix containing zeros and ones if an edge between two vertexes is absent or not

coordMatrix

A data frame containing the x and y coordinates of each vertex of the network

dijkstraPath

A vector of numbers corresponding to the vertexes of the shortest path through the network

Value

Function outputs a two-dimensional plot

Examples

# NOT RUN {
edgeMatrix <- matrix(0, nrow = 4, ncol = 4)
edgeMatrix[,1] <- c(0,1,0,0)
edgeMatrix[,2] <- c(1,0,1,1)
edgeMatrix[,3] <- c(0,1,0,0)
edgeMatrix[,4] <- c(0,1,0,0)
coordMatrix <- matrix(c(0,10,15,20,30,30,15,15),ncol = 2)
dijkstraPath <- c(4,2,1)
plotDijkstra(edgeMatrix, coordMatrix, dijkstraPath)

# }