Cmat2ArcList

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

nodes

$n\times n$ matrix that contains the
  weights or costs of the arcs. Row $i$ and column
  $j$ represents the endpoints of an arc, and the value
  of the index $ij$ is its weight or cost. If this
  value is <code>NA</code> or <code>Inf</code> means that there is no
  arc $ij$.

Cmat

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

directed


The <code>Cmat2ArcList</code> function builds the list of arcs of
a graph from a cost matrix that contains the weights of all
the arcs.


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.

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

Description

Usage

Arguments

Value