R/RcppExports.R

Defines functions Opt2TSPRunner NearestNeighborTSPRunner InsertionTSPRunner GreedyTSPRunner ChristofidesRunner BellmanFordRunner DijkstraRunner SuurballeRunner PlanarDrawingRunner PlanarColoringRunner PlanarEmbeddingRunner PlanarCheckingRunner MinCostArborescenceRunner KruskalRunner HartmannOrlinMmcRunner KarpMmcRunner HowardMmcRunner GomoryHuTreeRunner HaoOrlinRunner NagamochiIbarakiRunner NetworkSimplexRunner CostScalingRunner CapacityScalingRunner CycleCancellingRunner MaximumCardinalityFractionalMatchingRunner MaximumCardinalityMatchingRunner MaximumWeightMatchingRunner MaximumWeightFractionalMatchingRunner MaximumWeightFractionalPerfectMatchingRunner MaximumWeightPerfectMatchingRunner EdmondsKarpRunner PreflowRunner CirculationRunner MaxCardinalitySearchRunner DfsRunner BfsRunner GraphCompatabilityConverter FindBiEdgeConnectedComponentsRunner FindConnectedComponentsRunner FindBiNodeConnectedCutNodesRunner FindBiNodeConnectedComponentsRunner FindBiEdgeConnectedCutEdgesRunner FindStronglyConnectedCutArcsRunner FindStronglyConnectedComponentsRunner CountStronglyConnectedComponentsRunner CountBiNodeConnectedComponentsRunner CountConnectedComponentsRunner CountBiEdgeConnectedComponentsRunner IsEulerianRunner IsSimpleGraphRunner IsParallelFreeRunner IsLoopFreeRunner IsBiEdgeConnectedRunner IsBiNodeConnectedRunner IsDAGRunner IsStronglyConnectedRunner IsBipartiteRunner IsTreeRunner IsAcyclicRunner IsConnectedRunner getTopologicalSortRunner getAndCheckTopologicalSortRunner getBipartitePartitionsRunner GrossoLocatelliPullanMcRunner

Documented in BellmanFordRunner BfsRunner CapacityScalingRunner ChristofidesRunner CirculationRunner CostScalingRunner CountBiEdgeConnectedComponentsRunner CountBiNodeConnectedComponentsRunner CountConnectedComponentsRunner CountStronglyConnectedComponentsRunner CycleCancellingRunner DfsRunner DijkstraRunner EdmondsKarpRunner FindBiEdgeConnectedComponentsRunner FindBiEdgeConnectedCutEdgesRunner FindBiNodeConnectedComponentsRunner FindBiNodeConnectedCutNodesRunner FindConnectedComponentsRunner FindStronglyConnectedComponentsRunner FindStronglyConnectedCutArcsRunner getAndCheckTopologicalSortRunner getBipartitePartitionsRunner getTopologicalSortRunner GomoryHuTreeRunner GraphCompatabilityConverter GreedyTSPRunner GrossoLocatelliPullanMcRunner HaoOrlinRunner HartmannOrlinMmcRunner HowardMmcRunner InsertionTSPRunner IsAcyclicRunner IsBiEdgeConnectedRunner IsBiNodeConnectedRunner IsBipartiteRunner IsConnectedRunner IsDAGRunner IsEulerianRunner IsLoopFreeRunner IsParallelFreeRunner IsSimpleGraphRunner IsStronglyConnectedRunner IsTreeRunner KarpMmcRunner KruskalRunner MaxCardinalitySearchRunner MaximumCardinalityFractionalMatchingRunner MaximumCardinalityMatchingRunner MaximumWeightFractionalMatchingRunner MaximumWeightFractionalPerfectMatchingRunner MaximumWeightMatchingRunner MaximumWeightPerfectMatchingRunner MinCostArborescenceRunner NagamochiIbarakiRunner NearestNeighborTSPRunner NetworkSimplexRunner Opt2TSPRunner PlanarCheckingRunner PlanarColoringRunner PlanarDrawingRunner PlanarEmbeddingRunner PreflowRunner SuurballeRunner

# Generated by using Rcpp::compileAttributes() -> do not edit by hand
# Generator token: 10BE3573-1514-4C36-9D1C-5A225CD40393

#' @rdname lemon_runners
GrossoLocatelliPullanMcRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_GrossoLocatelliPullanMcRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
getBipartitePartitionsRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_getBipartitePartitionsRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
getAndCheckTopologicalSortRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_getAndCheckTopologicalSortRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
getTopologicalSortRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_getTopologicalSortRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
IsConnectedRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_IsConnectedRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
IsAcyclicRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_IsAcyclicRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
IsTreeRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_IsTreeRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
IsBipartiteRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_IsBipartiteRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
IsStronglyConnectedRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_IsStronglyConnectedRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
IsDAGRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_IsDAGRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
IsBiNodeConnectedRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_IsBiNodeConnectedRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
IsBiEdgeConnectedRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_IsBiEdgeConnectedRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
IsLoopFreeRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_IsLoopFreeRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
IsParallelFreeRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_IsParallelFreeRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
IsSimpleGraphRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_IsSimpleGraphRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
IsEulerianRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_IsEulerianRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
CountBiEdgeConnectedComponentsRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_CountBiEdgeConnectedComponentsRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
CountConnectedComponentsRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_CountConnectedComponentsRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
CountBiNodeConnectedComponentsRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_CountBiNodeConnectedComponentsRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
CountStronglyConnectedComponentsRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_CountStronglyConnectedComponentsRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
FindStronglyConnectedComponentsRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_FindStronglyConnectedComponentsRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
FindStronglyConnectedCutArcsRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_FindStronglyConnectedCutArcsRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
FindBiEdgeConnectedCutEdgesRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_FindBiEdgeConnectedCutEdgesRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
FindBiNodeConnectedComponentsRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_FindBiNodeConnectedComponentsRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
FindBiNodeConnectedCutNodesRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_FindBiNodeConnectedCutNodesRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
FindConnectedComponentsRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_FindConnectedComponentsRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
FindBiEdgeConnectedComponentsRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_FindBiEdgeConnectedComponentsRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
GraphCompatabilityConverter <- function(nodesList, arcSources, arcTargets) {
    .Call(`_rlemon_GraphCompatabilityConverter`, nodesList, arcSources, arcTargets)
}

#' @rdname lemon_runners
BfsRunner <- function(arcSources, arcTargets, numNodes, startNode = -1L, endNode = -1L) {
    .Call(`_rlemon_BfsRunner`, arcSources, arcTargets, numNodes, startNode, endNode)
}

#' @rdname lemon_runners
DfsRunner <- function(arcSources, arcTargets, numNodes, startNode = -1L, endNode = -1L) {
    .Call(`_rlemon_DfsRunner`, arcSources, arcTargets, numNodes, startNode, endNode)
}

#' @rdname lemon_runners
MaxCardinalitySearchRunner <- function(arcSources, arcTargets, arcCapacities, numNodes, startNode = -1L) {
    .Call(`_rlemon_MaxCardinalitySearchRunner`, arcSources, arcTargets, arcCapacities, numNodes, startNode)
}

#' @rdname lemon_runners
CirculationRunner <- function(arcSources, arcTargets, arcLowerBound, arcUpperBound, nodeSupplies, numNodes) {
    .Call(`_rlemon_CirculationRunner`, arcSources, arcTargets, arcLowerBound, arcUpperBound, nodeSupplies, numNodes)
}

#' @rdname lemon_runners
PreflowRunner <- function(arcSources, arcTargets, arcDistances, sourceNode, destinationNode, numNodes) {
    .Call(`_rlemon_PreflowRunner`, arcSources, arcTargets, arcDistances, sourceNode, destinationNode, numNodes)
}

#' @rdname lemon_runners
EdmondsKarpRunner <- function(arcSources, arcTargets, arcDistances, sourceNode, destinationNode, numNodes) {
    .Call(`_rlemon_EdmondsKarpRunner`, arcSources, arcTargets, arcDistances, sourceNode, destinationNode, numNodes)
}

#' @rdname lemon_runners
MaximumWeightPerfectMatchingRunner <- function(arcSources, arcTargets, arcWeights, numNodes) {
    .Call(`_rlemon_MaximumWeightPerfectMatchingRunner`, arcSources, arcTargets, arcWeights, numNodes)
}

#' @rdname lemon_runners
MaximumWeightFractionalPerfectMatchingRunner <- function(arcSources, arcTargets, arcWeights, numNodes) {
    .Call(`_rlemon_MaximumWeightFractionalPerfectMatchingRunner`, arcSources, arcTargets, arcWeights, numNodes)
}

#' @rdname lemon_runners
MaximumWeightFractionalMatchingRunner <- function(arcSources, arcTargets, arcWeights, numNodes) {
    .Call(`_rlemon_MaximumWeightFractionalMatchingRunner`, arcSources, arcTargets, arcWeights, numNodes)
}

#' @rdname lemon_runners
MaximumWeightMatchingRunner <- function(arcSources, arcTargets, arcWeights, numNodes) {
    .Call(`_rlemon_MaximumWeightMatchingRunner`, arcSources, arcTargets, arcWeights, numNodes)
}

#' @rdname lemon_runners
MaximumCardinalityMatchingRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_MaximumCardinalityMatchingRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
MaximumCardinalityFractionalMatchingRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_MaximumCardinalityFractionalMatchingRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
CycleCancellingRunner <- function(arcSources, arcTargets, arcCapacities, arcCosts, nodeSupplies, numNodes) {
    .Call(`_rlemon_CycleCancellingRunner`, arcSources, arcTargets, arcCapacities, arcCosts, nodeSupplies, numNodes)
}

#' @rdname lemon_runners
CapacityScalingRunner <- function(arcSources, arcTargets, arcCapacities, arcCosts, nodeSupplies, numNodes) {
    .Call(`_rlemon_CapacityScalingRunner`, arcSources, arcTargets, arcCapacities, arcCosts, nodeSupplies, numNodes)
}

#' @rdname lemon_runners
CostScalingRunner <- function(arcSources, arcTargets, arcCapacities, arcCosts, nodeSupplies, numNodes) {
    .Call(`_rlemon_CostScalingRunner`, arcSources, arcTargets, arcCapacities, arcCosts, nodeSupplies, numNodes)
}

#' @rdname lemon_runners
NetworkSimplexRunner <- function(arcSources, arcTargets, arcCapacities, arcCosts, nodeSupplies, numNodes) {
    .Call(`_rlemon_NetworkSimplexRunner`, arcSources, arcTargets, arcCapacities, arcCosts, nodeSupplies, numNodes)
}

#' @rdname lemon_runners
NagamochiIbarakiRunner <- function(arcSources, arcTargets, arcWeights, numNodes) {
    .Call(`_rlemon_NagamochiIbarakiRunner`, arcSources, arcTargets, arcWeights, numNodes)
}

#' @rdname lemon_runners
HaoOrlinRunner <- function(arcSources, arcTargets, arcWeights, numNodes) {
    .Call(`_rlemon_HaoOrlinRunner`, arcSources, arcTargets, arcWeights, numNodes)
}

#' @rdname lemon_runners
GomoryHuTreeRunner <- function(arcSources, arcTargets, arcWeights, numNodes) {
    .Call(`_rlemon_GomoryHuTreeRunner`, arcSources, arcTargets, arcWeights, numNodes)
}

#' @rdname lemon_runners
HowardMmcRunner <- function(arcSources, arcTargets, arcDistances, numNodes) {
    .Call(`_rlemon_HowardMmcRunner`, arcSources, arcTargets, arcDistances, numNodes)
}

#' @rdname lemon_runners
KarpMmcRunner <- function(arcSources, arcTargets, arcDistances, numNodes) {
    .Call(`_rlemon_KarpMmcRunner`, arcSources, arcTargets, arcDistances, numNodes)
}

#' @rdname lemon_runners
HartmannOrlinMmcRunner <- function(arcSources, arcTargets, arcDistances, numNodes) {
    .Call(`_rlemon_HartmannOrlinMmcRunner`, arcSources, arcTargets, arcDistances, numNodes)
}

#' @rdname lemon_runners
KruskalRunner <- function(arcSources, arcTargets, arcDistances, numNodes) {
    .Call(`_rlemon_KruskalRunner`, arcSources, arcTargets, arcDistances, numNodes)
}

#' @rdname lemon_runners
MinCostArborescenceRunner <- function(arcSources, arcTargets, arcDistances, sourceNode, numNodes) {
    .Call(`_rlemon_MinCostArborescenceRunner`, arcSources, arcTargets, arcDistances, sourceNode, numNodes)
}

#' @rdname lemon_runners
PlanarCheckingRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_PlanarCheckingRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
PlanarEmbeddingRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_PlanarEmbeddingRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
PlanarColoringRunner <- function(arcSources, arcTargets, numNodes, useFiveAlg = TRUE) {
    .Call(`_rlemon_PlanarColoringRunner`, arcSources, arcTargets, numNodes, useFiveAlg)
}

#' @rdname lemon_runners
PlanarDrawingRunner <- function(arcSources, arcTargets, numNodes) {
    .Call(`_rlemon_PlanarDrawingRunner`, arcSources, arcTargets, numNodes)
}

#' @rdname lemon_runners
SuurballeRunner <- function(arcSources, arcTargets, arcDistances, numNodes, startNode, endNode) {
    .Call(`_rlemon_SuurballeRunner`, arcSources, arcTargets, arcDistances, numNodes, startNode, endNode)
}

#' @rdname lemon_runners
DijkstraRunner <- function(arcSources, arcTargets, arcDistances, numNodes, startNode) {
    .Call(`_rlemon_DijkstraRunner`, arcSources, arcTargets, arcDistances, numNodes, startNode)
}

#' @rdname lemon_runners
BellmanFordRunner <- function(arcSources, arcTargets, arcDistances, numNodes, startNode) {
    .Call(`_rlemon_BellmanFordRunner`, arcSources, arcTargets, arcDistances, numNodes, startNode)
}

#' @rdname lemon_runners
ChristofidesRunner <- function(arcSources, arcTargets, arcDistances, numNodes, defaultEdgeWeight = 999999L) {
    .Call(`_rlemon_ChristofidesRunner`, arcSources, arcTargets, arcDistances, numNodes, defaultEdgeWeight)
}

#' @rdname lemon_runners
GreedyTSPRunner <- function(arcSources, arcTargets, arcDistances, numNodes, defaultEdgeWeight = 999999L) {
    .Call(`_rlemon_GreedyTSPRunner`, arcSources, arcTargets, arcDistances, numNodes, defaultEdgeWeight)
}

#' @rdname lemon_runners
InsertionTSPRunner <- function(arcSources, arcTargets, arcDistances, numNodes, defaultEdgeWeight = 999999L) {
    .Call(`_rlemon_InsertionTSPRunner`, arcSources, arcTargets, arcDistances, numNodes, defaultEdgeWeight)
}

#' @rdname lemon_runners
NearestNeighborTSPRunner <- function(arcSources, arcTargets, arcDistances, numNodes, defaultEdgeWeight = 999999L) {
    .Call(`_rlemon_NearestNeighborTSPRunner`, arcSources, arcTargets, arcDistances, numNodes, defaultEdgeWeight)
}

#' @rdname lemon_runners
Opt2TSPRunner <- function(arcSources, arcTargets, arcDistances, numNodes, defaultEdgeWeight = 999999L) {
    .Call(`_rlemon_Opt2TSPRunner`, arcSources, arcTargets, arcDistances, numNodes, defaultEdgeWeight)
}

Try the rlemon package in your browser

Any scripts or data that you put into this service are public.

rlemon documentation built on Feb. 16, 2023, 5:33 p.m.