ArcList2Cmat

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


The <code>ArcList2Cmat</code> function constructs the cost matrix
of a graph from a list that contains the arcs and its
associated weights.


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.

ArcList2Cmat: Builds the cost matrix of a graph from its list of arcs

Description

Usage

Arguments

Value