R Access to LEMON Graph Algorithms

Documentation for package ‘rlemon’ version 0.1.0

DESCRIPTION file.

Help Pages

-- A --

AllPairsMinCut	AllPairsMinCut
Approximation-Algorithms	Approximation Algorithms

-- B --

BellmanFordRunner	Shortest Path Algorithms - Distance
BfsRunner	Graph Search Algorithms

-- C --

CapacityScalingRunner	Minimum Cost Flow Algorithms
check_arc_map	Check arc maps for common errors. Doesn't check if the underlying graph is correct - see 'check_graph_vertices' for that purpose. Specifically checks if the number of arcs in the graph is the same as the number in the map.
check_graph	Check graph inputs for common issues. Specifically checks if arc source, target, capacity, and cost arrays have the same length. Additionally, checks if all arc sources and targets are integral.
check_graph_arcs	Check arcs for common errors. Specifically, check that the number of source nodes is the same as the number of target nodes, and that all arc sources and targets are integral.
check_graph_vertices	Check sources and target arrays for common errors. Specifically checks that graphs follow 1-indexing conventions, that the number of source and target nodes are the same, and that all node indices are integral.
check_node	Check node definitions for common errors. Specifically, checks that all nodes are integral, and that they are consistent with 1-based indexing.
check_node_map	Check node maps for common errors. Doesn't check if the underlying graph is correct - see 'check_graph_vertices' for that purpose. Specifically checks if the number of nodes is inconsistent.
ChristofidesRunner	Traveling Salesperson Algorithms on Full Graphs
CirculationRunner	Maximum Flow Algorithms - Network Circulation
Connectivity-Algorithms-1	Connectivity Algorithms - Boolean Return
Connectivity-Algorithms-2	Connectivity Algorithms - Integer Return
Connectivity-Algorithms-3	Connectivity Algorithms - List Return
CostScalingRunner	Minimum Cost Flow Algorithms
CountBiEdgeConnectedComponents	CountBiEdgeConnectedComponents
CountBiEdgeConnectedComponentsRunner	Connectivity Algorithms - Integer Return
CountBiNodeConnectedComponents	CountBiNodeConnectedComponents
CountBiNodeConnectedComponentsRunner	Connectivity Algorithms - Integer Return
CountConnectedComponents	CountConnectedComponents
CountConnectedComponentsRunner	Connectivity Algorithms - Integer Return
CountStronglyConnectedComponents	CountStronglyConnectedComponents
CountStronglyConnectedComponentsRunner	Connectivity Algorithms - Integer Return
CycleCancellingRunner	Minimum Cost Flow Algorithms

-- D --

DfsRunner	Graph Search Algorithms
DijkstraRunner	Shortest Path Algorithms - Distance

-- E --

EdmondsKarpRunner

Maximum Flow Algorithms

-- F --

FindBiEdgeConnectedComponents	FindBiEdgeConnectedComponents
FindBiEdgeConnectedComponentsRunner	Connectivity Algorithms - List Return
FindBiEdgeConnectedCutEdges	FindBiEdgeConnectedCutEdges
FindBiEdgeConnectedCutEdgesRunner	Connectivity Algorithms - List Return
FindBiNodeConnectedComponents	FindBiNodeConnectedComponents
FindBiNodeConnectedComponentsRunner	Connectivity Algorithms - List Return
FindBiNodeConnectedCutNodes	FindBiNodeConnectedCutNodes
FindBiNodeConnectedCutNodesRunner	Connectivity Algorithms - List Return
FindConnectedComponents	FindConnectedComponents
FindConnectedComponentsRunner	Connectivity Algorithms - List Return
FindStronglyConnectedComponents	FindStronglyConnectedComponents
FindStronglyConnectedComponentsRunner	Connectivity Algorithms - List Return
FindStronglyConnectedCutArcs	FindStronglyConnectedCutArcs
FindStronglyConnectedCutArcsRunner	Connectivity Algorithms - List Return

-- G --

GetAndCheckTopologicalSort	GetAndCheckTopologicalSort
getAndCheckTopologicalSortRunner	Connectivity Algorithms - List Return
GetBipartitePartitions	GetBipartitePartitions
getBipartitePartitionsRunner	Connectivity Algorithms - List Return
GetTopologicalSort	GetTopologicalSort
getTopologicalSortRunner	Connectivity Algorithms - List Return
GomoryHuTreeRunner	Minimum Cut Algorithms - Gomory Hu Tree
Graph-Converter	Compatible Graph Converter
Graph-Search-Algorithms-1	Graph Search Algorithms
Graph-Search-Algorithms-2	Graph Search Algorithms
GraphCompatabilityConverter	Compatible Graph Converter
GraphSearch	GraphSearch
GreedyTSPRunner	Traveling Salesperson Algorithms on Full Graphs
GrossoLocatelliPullanMcRunner	Approximation Algorithms

-- H --

HaoOrlinRunner	Minimum Cut Algorithms
HartmannOrlinMmcRunner	Minimum Mean-Cycle Algorithms
HowardMmcRunner	Minimum Mean-Cycle Algorithms

-- I --

Input-Information	Graph Input Specifications
InsertionTSPRunner	Traveling Salesperson Algorithms on Full Graphs
IsAcyclic	IsAcylic
IsAcyclicRunner	Connectivity Algorithms - Boolean Return
IsBiEdgeConnected	IsBiEdgeConnected
IsBiEdgeConnectedRunner	Connectivity Algorithms - Boolean Return
IsBiNodeConnected	IsBiNodeConnected
IsBiNodeConnectedRunner	Connectivity Algorithms - Boolean Return
IsBipartite	IsBipartite
IsBipartiteRunner	Connectivity Algorithms - Boolean Return
IsConnected	IsConnected
IsConnectedRunner	Connectivity Algorithms - Boolean Return
IsDAG	IsDAG
IsDAGRunner	Connectivity Algorithms - Boolean Return
IsEulerian	IsEulerian
IsEulerianRunner	Connectivity Algorithms - Boolean Return
IsLoopFree	IsLoopFree
IsLoopFreeRunner	Connectivity Algorithms - Boolean Return
IsParallelFree	IsParallelFree
IsParallelFreeRunner	Connectivity Algorithms - Boolean Return
IsSimpleGraph	IsSimpleGraph
IsSimpleGraphRunner	Connectivity Algorithms - Boolean Return
IsStronglyConnected	IsStronglyConnected
IsStronglyConnectedRunner	Connectivity Algorithms - Boolean Return
IsTree	IsTree
IsTreeRunner	Connectivity Algorithms - Boolean Return

-- K --

KarpMmcRunner	Minimum Mean-Cycle Algorithms
KruskalRunner	MST Algorithms

-- M --

MaxCardinalityMatching	MaxCardinalityMatching
MaxCardinalitySearch	MaxCardinalitySearch
MaxCardinalitySearchRunner	Graph Search Algorithms
MaxClique	MaxClique
MaxFlow	MaxFlow
Maximum-Flow-Algorithms-1	Maximum Flow Algorithms
Maximum-Flow-Algorithms-2	Maximum Flow Algorithms - Network Circulation
Maximum-Matching-Algorithms	Maximum Matching Algorithms
Maximum-Mean-Cycle-Algorithms	Minimum Mean-Cycle Algorithms
MaximumCardinalityFractionalMatchingRunner	Maximum Matching Algorithms
MaximumCardinalityMatchingRunner	Maximum Matching Algorithms
MaximumWeightFractionalMatchingRunner	Maximum Matching Algorithms
MaximumWeightFractionalPerfectMatchingRunner	Maximum Matching Algorithms
MaximumWeightMatchingRunner	Maximum Matching Algorithms
MaximumWeightPerfectMatchingRunner	Maximum Matching Algorithms
MaxMatching	MaxMatching
MinCostArborescence	MinCostArborescence
MinCostArborescenceRunner	Arborescence Algorithms
MinCostFlow	MinCostFlow
MinCut	MinCut
Minimum-Cost-Arborescence-Algorithms	Arborescence Algorithms
Minimum-Cost-Flow-Algorithms	Minimum Cost Flow Algorithms
Minimum-Cut-Algorithms-1	Minimum Cut Algorithms
Minimum-Cut-Algorithms-2	Minimum Cut Algorithms - Gomory Hu Tree
Minimum-Spanning-Tree-Algorithms	MST Algorithms
MinMeanCycle	MinimumMeanCycle
MinSpanningTree	MinSpanningTree

-- N --

NagamochiIbarakiRunner	Minimum Cut Algorithms
NearestNeighborTSPRunner	Traveling Salesperson Algorithms on Full Graphs
NetworkCirculation	NetworkCirculation
NetworkSimplexRunner	Minimum Cost Flow Algorithms

-- O --

Opt2TSPRunner

Traveling Salesperson Algorithms on Full Graphs

-- P --

Planar-Embedding-Algorithms	Planar Embedding Algorithms
Planar-Embedding-Algorithms-2	Planar Embedding Algorithms
PlanarChecking	PlanarChecking
PlanarCheckingRunner	Planar Embedding Algorithms
PlanarColoring	PlanarColoring
PlanarColoringRunner	Planar Embedding Algorithms
PlanarDrawing	PlanarDrawing
PlanarDrawingRunner	Planar Embedding Algorithms
PlanarEmbedding	PlanarEmbedding
PlanarEmbeddingRunner	Planar Embedding Algorithms
PreflowRunner	Maximum Flow Algorithms

-- S --

Shortest-Path-Algorithms-1	Shortest Path Algorithms - Distance
Shortest-Path-Algorithms-2	Shortest Path Algorithms - Paths
ShortestPath	ShortestPath
ShortestPathFromSource	ShortestPathFromSource
small_graph_example	A small network graph example
SuurballeRunner	Shortest Path Algorithms - Paths

-- T --

TravelingSalesperson	TravelingSalespersonProblem
TravellingSalesperson	TravelingSalespersonProblem
TSP-Algorithms	Traveling Salesperson Algorithms on Full Graphs