shortestpath: The shortestpath package

In huoston/shortestpath: Shortest Path Algorithm Visualization

Description

The shortestpath package provides a set of functions to execute and visualize algorithms that solve shortest path problems.

Creating graphs

To create random graphs, which are neither too uniform nor too degenerated, shortestpath's randomGraph function can be used. This method generates a random graph with the given number of nodes and average connectivity.

All shortest path algorithms also accept regular igraph graph objects as input.

Algorithms

The package implements the following algorithms:

• Dijkstra (dijkstra)

• A* Search (aStarSearch)

• Bellman-Ford (bellmanFord)

• Floyd-Warshall (floydWarshall)

Visualization

R's builtin plot() and print() functions can be used to visualize the results and intermediate steps of each algorithm. There is a multitude of settings to configure plot visuals (see plot.spgraph).

Moreover, the package also provides features to export the results to LaTeX tables (toLatexTable) and TikZ plots (toLatexGraph).

Detailed information

A more detailed documentation of the package in the form of R vignette can be accessed by running browseVignettes("shortestpath").

See

• vignette("p01-getting-started", package = "shortestpath") for an introduction and initial overview,

• vignette("p02-generating-graphs", package = "shortestpath") for getting to know different functions to generate graphs,

• vignette("p03-algorithms", package = "shortestpath") for detailed information about each of the algorithm and how they differ,

• vignette("p04-export", package = "shortestpath") for becoming familiar with the packages's functions to visualize the optimization steps and

• vignette("p05-data-structures", package = "shortestpath") for learning more details about the structure and functions of spgraph and spresult objects

huoston/shortestpath documentation built on May 25, 2019, 8:18 a.m.