traverse_graph: Calculate pathways across bridges

In dSHARP-CMU/konigsbergr: Find Paths Through Bridges On A Map

Description

These functions calculate pathways across bridges in konigsberg_graph objects.

Usage

cross_all_bridges(graph, starting_node = NULL, cheat = TRUE,
  quiet = FALSE, ...)

cross_specific_bridges(graph, starting_node = NULL,
  required_bridges = NULL, cheat = TRUE, quiet = FALSE, ...)

Arguments

graph	A konigsberg_graph
starting_node	An integer specifying the OSM id of the starting node. Defaults to the first vertex in graph.
cheat	Boolean. Allow pathway to re-cross bridges?
quiet	Boolean. Suppress progress messages?
...	Additional variables passed to greedy_search()
required_bridges	The Way or Relation ids of bridges that must be crossed.

Value

A konigsberg_path object, which inherits from the pathfinder_path object from greedy_search()

Functions

• cross_all_bridges: Cross every bridge in the graph

• cross_specific_bridges: Cross only specified bridges

dSHARP-CMU/konigsbergr documentation built on Sept. 11, 2019, 3:55 p.m.