SPP.Dijkstra: Shortest-Path-Problem - Algorithm of Dijkstra

In felixlindemann/HNUORTools: Operations Research Tools

Description

Calculates the Shortest Path from one node to all others in a network.

Usage

SPP.Dijkstra(object, ...)

## S4 method for signature 'GeoSituation'
SPP.Dijkstra(object, ...)

Arguments

object	Object of Type GeoSituation
...	See below for optional parameters.

Details

This implementation uses the costs attribute of the Links provided.

Value

same modified object of Type GeoSituation. The Solution will be assigned the attribute shortestpath.

Optional Parameters (...)

used by SPP.Dijkstra

log

optional "logical". Indicating if the calculations should be logged. Default is FALSE.

debug

optional "logical". Indicating if the calculations should be debugged Default is FALSE. This means, that each process step is logged to the console.

start

optional "numeric". Indicates which Node(-index) should be used as startnode. Default is 1.

Has to be a positive 0 < value <= N (with N = the number of nodes in the Scenario.)

Forwarded to the follwowing functions

• ... is currently not forwared.

Note

for citing use: Felix Lindemann (2014). HNUORTools: Operations Research Tools. R package version 1.1-0. http://felixlindemann.github.io/HNUORTools/.

Author(s)

Dipl. Kfm. Felix Lindemann [e-mail]

Wissenschaftlicher Mitarbeiter Kompetenzzentrum Logistik Buro ZWEI, 17

Hochschule fur angewandte Wissenschaften Fachhochschule Neu-Ulm | Neu-Ulm University Wileystr. 1

D-89231 Neu-Ulm

Phone [phone] Web www.hs-neu-ulm.de/felix-lindemann/ http://felixlindemann.blogspot.de

References

Domschke

See Also

GeoSituation, Node

Examples

# demo(HNUSPP01)

felixlindemann/HNUORTools documentation built on May 8, 2019, 6:46 p.m.