Package: rlemon 0.2.1.9001

rlemon: R Access to LEMON Graph Algorithms

Allows easy access to the LEMON Graph Library set of algorithms, written in C++. See the LEMON project page at <https://lemon.cs.elte.hu/trac/lemon>. Current LEMON version is 1.3.1.

Authors:Arav Agarwal [aut], Aditya Tewari [aut], Josh Errickson [cre, aut]

rlemon_0.2.1.9001.tar.gz
rlemon_0.2.1.9001.zip(r-4.5)rlemon_0.2.1.9001.zip(r-4.4)rlemon_0.2.1.9001.zip(r-4.3)
rlemon_0.2.1.9001.tgz(r-4.4-x86_64)rlemon_0.2.1.9001.tgz(r-4.4-arm64)rlemon_0.2.1.9001.tgz(r-4.3-x86_64)rlemon_0.2.1.9001.tgz(r-4.3-arm64)
rlemon_0.2.1.9001.tar.gz(r-4.5-noble)rlemon_0.2.1.9001.tar.gz(r-4.4-noble)
rlemon_0.2.1.9001.tgz(r-4.4-emscripten)rlemon_0.2.1.9001.tgz(r-4.3-emscripten)
rlemon.pdf |rlemon.html
rlemon/json (API)
NEWS

# Install 'rlemon' in R:
install.packages('rlemon', repos = c('https://josherrickson.r-universe.dev', 'https://cloud.r-project.org'))

Peer review:

Bug tracker:https://github.com/josherrickson/rlemon/issues

Uses libs:
  • c++– GNU Standard C++ Library v3
Datasets:

On CRAN:

6.88 score 8 stars 12 packages 1 scripts 3.3k downloads 47 exports 1 dependencies

Last updated 2 months agofrom:9be913c90f. Checks:OK: 9. Indexed: yes.

TargetResultDate
Doc / VignettesOKNov 02 2024
R-4.5-win-x86_64OKNov 02 2024
R-4.5-linux-x86_64OKNov 02 2024
R-4.4-win-x86_64OKNov 02 2024
R-4.4-mac-x86_64OKNov 02 2024
R-4.4-mac-aarch64OKNov 02 2024
R-4.3-win-x86_64OKNov 02 2024
R-4.3-mac-x86_64OKNov 02 2024
R-4.3-mac-aarch64OKNov 02 2024

Exports:AllPairsMinCutCountBiEdgeConnectedComponentsCountBiNodeConnectedComponentsCountConnectedComponentsCountStronglyConnectedComponentsFindBiEdgeConnectedComponentsFindBiEdgeConnectedCutEdgesFindBiNodeConnectedComponentsFindBiNodeConnectedCutNodesFindConnectedComponentsFindStronglyConnectedComponentsFindStronglyConnectedCutArcsGetAndCheckTopologicalSortGetBipartitePartitionsGetTopologicalSortGraphSearchIsAcyclicIsBiEdgeConnectedIsBiNodeConnectedIsBipartiteIsConnectedIsDAGIsEulerianIsLoopFreeIsParallelFreeIsSimpleGraphIsStronglyConnectedIsTreeMaxCardinalityMatchingMaxCardinalitySearchMaxCliqueMaxFlowMaxMatchingMinCostArborescenceMinCostFlowMinCutMinMeanCycleMinSpanningTreeNetworkCirculationPlanarCheckingPlanarColoringPlanarDrawingPlanarEmbeddingShortestPathShortestPathFromSourceTravelingSalespersonTravellingSalesperson

Dependencies:Rcpp

Readme and manuals

Help Manual

Help pageTopics
Solver for All-Pairs MinCutAllPairsMinCut
Count Number of Bi-Edge-Connected ComponentsCountBiEdgeConnectedComponents
Count Number of Bi-Node-Connected ComponentsCountBiNodeConnectedComponents
Count the Number of Connected ComponentsCountConnectedComponents
Count the Number of Strongly Connected ComponentsCountStronglyConnectedComponents
Find Bi-Edge-Connected ComponentsFindBiEdgeConnectedComponents
Find Bi-Edge-Connected Cut EdgesFindBiEdgeConnectedCutEdges
Find Bi-Node-Connected ComponentsFindBiNodeConnectedComponents
Find Bi-Node-Connected Cut NodesFindBiNodeConnectedCutNodes
Find Connected ComponentsFindConnectedComponents
Find Strongly Connected ComponentsFindStronglyConnectedComponents
Find Strongly Connected Cut ArcsFindStronglyConnectedCutArcs
Check if Graph is DAG, then Sorts Nodes into Topological OrderGetAndCheckTopologicalSort
Obtains (if possible) Bipartite SplitGetBipartitePartitions
Sorts Nodes into Topological OrderGetTopologicalSort
Solver for Graph SearchGraphSearch
LEMON runnersBellmanFordRunner 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 lemon_runners MaxCardinalitySearchRunner MaximumCardinalityFractionalMatchingRunner MaximumCardinalityMatchingRunner MaximumWeightFractionalMatchingRunner MaximumWeightFractionalPerfectMatchingRunner MaximumWeightMatchingRunner MaximumWeightPerfectMatchingRunner MinCostArborescenceRunner NagamochiIbarakiRunner NearestNeighborTSPRunner NetworkSimplexRunner Opt2TSPRunner PlanarCheckingRunner PlanarColoringRunner PlanarDrawingRunner PlanarEmbeddingRunner PreflowRunner SuurballeRunner
Check if Graph is Acyclic.IsAcyclic
Chcek if Graph is Bi-Edge-ConnectedIsBiEdgeConnected
Checks if Graph is Bi-Node-ConnectedIsBiNodeConnected
Checks if Graph is BipartiteIsBipartite
Check if Graph is ConnectedIsConnected
Check if Graph is a DAG.IsDAG
Check if Graph is EulerianIsEulerian
Checks if Graph is Loop FreeIsLoopFree
Check if Graph is Parallel FreeIsParallelFree
Check if Graph is SimpleIsSimpleGraph
Check if Graph is Strongly ConnectedIsStronglyConnected
Check if Graph is a TreeIsTree
Solve for Maximum Cardinality MatchingMaxCardinalityMatching
Solver for Max Cardinality SearchMaxCardinalitySearch
Solver for Largest Complete Subgroup (All Nodes Connected)MaxClique
Solver for MaxFlowMaxFlow
Solver for Maximum Weighted MatchingMaxMatching
Solver for Minimum Cost ArborescenceMinCostArborescence
Solver for MinCostFlowMinCostFlow
Solver for MinCutMinCut
Solver for Minimum Mean CycleMinMeanCycle
Solver for Minimum Spanning TreeMinSpanningTree
Solver for Network CirculationNetworkCirculation
Check if Graph is PlanarPlanarChecking
Solver for Planar ColoringPlanarColoring
Solver for Planar DrawingPlanarDrawing
Solver for Planar EmbeddingPlanarEmbedding
Solver for Shortest Path Between Two NodesShortestPath
Solve for Shortest Path from Source Node to All Other NodesShortestPathFromSource
A small network graph examplesmall_graph_example
Solver for Traveling Salesperson ProblemTravelingSalesperson TravellingSalesperson