Skip to contents

Solver for Minimum Mean Cycle

Source: R/minimummeancycle.R
MinMeanCycle.Rd

Finds the Minimum Mean Cycle in directed graphs.

Usage

MinMeanCycle(
  arcSources,
  arcTargets,
  arcDistances,
  numNodes,
  algorithm = "Howard"
)

Arguments

arcSources

Vector corresponding to the source nodes of a graph's edges

arcTargets

Vector corresponding to the destination nodes of a graph's edges

arcDistances

Vector corresponding to the distances of a graph's edges

numNodes

The number of nodes in the graph

algorithm

Choices of algorithm include "Howard", "Karp", and "HartmannOrlin". "Howard" is the default.

Value

A named list containing two entries: 1) "cost": a vector containing the costs of each edge in the Minimum Mean Cyckle, and 2) "nodes": the nodes in the Minimum Mean Cycle.

Details

For details on LEMON's implementation, including differences between the algorithms, see https://lemon.cs.elte.hu/pub/doc/1.3.1/a00614.html.