mincostflow: Min-Cost-Max-Flow for cellular trajectories

View source: R/trajectories.R

mincostflowR Documentation

Min-Cost-Max-Flow for cellular trajectories

Description

Applies Min-Cost-Max-Flow to calculate optimal trajectories from distance matrices.

Usage

mincostflow(D.list, verbose = TRUE)

Arguments

D.list

List of (pruned) distance matrices. Can be generated by the distmat function.

verbose

Show verbose output.

Value

Matrix of cell-cell trajectories spanning all given timepoints.

Examples



# Full vignette available on https://grandr.erhard-lab.de/articles/web/hetseq.html

  mincostflow(D.list)


HetSeq documentation built on April 4, 2025, 2:03 a.m.