min.node.weight.path: —————— Find the shortest path with minimal node...

In matthiasheinig/QTLnetwork: Basic package to apply random walks for QTL candidate gene priorization

Description

—————————————————————————– Find the shortest path with minimal node weight.

Usage

## S3 method for class 'node.weight.path'
min(g, weights, from, to)

Arguments

g	The graphNEL object
weights	The weights calculated for the nodes
from	The start nodes from which to start the min-node-weight path
to	The target nodes to which to calcaulate the min-node-weight path

Author(s)

Matthias Heinig <[e-mail]>

—————————————————————————–

matthiasheinig/QTLnetwork documentation built on June 29, 2021, 10:11 p.m.