searchWalk

vector containing the nodes of the graph,
  identified by a number that goes from $1$ to the
  order of the graph.

nodes

matrix with the list of arcs of the graph.
  Each row represents one arc. The first two columns
  contain the two endpoints of each arc and the third
  column contains their weights.

arcs

logical value indicating whether the
  graph is directed (<code>TRUE</code>) or not (<code>FALSE</code>).

directed

number with one node from which a walk
  start.

start.node

end.node

character string specifying which method
  use to select the arcs that will form the open walk:
  <code>"min"</code> if the function chooses the minimum weight
  arcs, <code>"max"</code> if chooses the maximum weight arcs, or
  <code>NULL</code> if chooses the arcs by their order in the
  list of arcs.

method


This function walks a given graph, directed or not,
searching for a walk from a starting node to a final node.
The <code>searchWalk</code> function uses a deep-first search
strategy to returns the first open walk found, regardless
it has formed cycles or repeated nodes.


Finds optimal trees in weighted graphs. In
particular, this package provides solving tools for minimum cost spanning
tree problems, minimum cost arborescence problems, shortest path tree
problems and minimum cut tree problem.

searchWalk: Finds an open walk in a graph

Description

Usage

Arguments

Value