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:
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')) |
Bug tracker:https://github.com/josherrickson/rlemon/issues
- small_graph_example - A small network graph example
Last updated 1 months agofrom:9be913c90f. Checks:OK: 9. Indexed: yes.
| Target | Result | Date |
|---|---|---|
| Doc / Vignettes | OK | Nov 02 2024 |
| R-4.5-win-x86_64 | OK | Nov 02 2024 |
| R-4.5-linux-x86_64 | OK | Nov 02 2024 |
| R-4.4-win-x86_64 | OK | Nov 02 2024 |
| R-4.4-mac-x86_64 | OK | Nov 02 2024 |
| R-4.4-mac-aarch64 | OK | Nov 02 2024 |
| R-4.3-win-x86_64 | OK | Nov 02 2024 |
| R-4.3-mac-x86_64 | OK | Nov 02 2024 |
| R-4.3-mac-aarch64 | OK | Nov 02 2024 |
Exports:AllPairsMinCutCountBiEdgeConnectedComponentsCountBiNodeConnectedComponentsCountConnectedComponentsCountStronglyConnectedComponentsFindBiEdgeConnectedComponentsFindBiEdgeConnectedCutEdgesFindBiNodeConnectedComponentsFindBiNodeConnectedCutNodesFindConnectedComponentsFindStronglyConnectedComponentsFindStronglyConnectedCutArcsGetAndCheckTopologicalSortGetBipartitePartitionsGetTopologicalSortGraphSearchIsAcyclicIsBiEdgeConnectedIsBiNodeConnectedIsBipartiteIsConnectedIsDAGIsEulerianIsLoopFreeIsParallelFreeIsSimpleGraphIsStronglyConnectedIsTreeMaxCardinalityMatchingMaxCardinalitySearchMaxCliqueMaxFlowMaxMatchingMinCostArborescenceMinCostFlowMinCutMinMeanCycleMinSpanningTreeNetworkCirculationPlanarCheckingPlanarColoringPlanarDrawingPlanarEmbeddingShortestPathShortestPathFromSourceTravelingSalespersonTravellingSalesperson
Dependencies:Rcpp
Readme and manuals
Help Manual
| Help page | Topics |
|---|---|
| Solver for All-Pairs MinCut | AllPairsMinCut |
| Count Number of Bi-Edge-Connected Components | CountBiEdgeConnectedComponents |
| Count Number of Bi-Node-Connected Components | CountBiNodeConnectedComponents |
| Count the Number of Connected Components | CountConnectedComponents |
| Count the Number of Strongly Connected Components | CountStronglyConnectedComponents |
| Find Bi-Edge-Connected Components | FindBiEdgeConnectedComponents |
| Find Bi-Edge-Connected Cut Edges | FindBiEdgeConnectedCutEdges |
| Find Bi-Node-Connected Components | FindBiNodeConnectedComponents |
| Find Bi-Node-Connected Cut Nodes | FindBiNodeConnectedCutNodes |
| Find Connected Components | FindConnectedComponents |
| Find Strongly Connected Components | FindStronglyConnectedComponents |
| Find Strongly Connected Cut Arcs | FindStronglyConnectedCutArcs |
| Check if Graph is DAG, then Sorts Nodes into Topological Order | GetAndCheckTopologicalSort |
| Obtains (if possible) Bipartite Split | GetBipartitePartitions |
| Sorts Nodes into Topological Order | GetTopologicalSort |
| Solver for Graph Search | GraphSearch |
| LEMON runners | 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 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-Connected | IsBiEdgeConnected |
| Checks if Graph is Bi-Node-Connected | IsBiNodeConnected |
| Checks if Graph is Bipartite | IsBipartite |
| Check if Graph is Connected | IsConnected |
| Check if Graph is a DAG. | IsDAG |
| Check if Graph is Eulerian | IsEulerian |
| Checks if Graph is Loop Free | IsLoopFree |
| Check if Graph is Parallel Free | IsParallelFree |
| Check if Graph is Simple | IsSimpleGraph |
| Check if Graph is Strongly Connected | IsStronglyConnected |
| Check if Graph is a Tree | IsTree |
| Solve for Maximum Cardinality Matching | MaxCardinalityMatching |
| Solver for Max Cardinality Search | MaxCardinalitySearch |
| Solver for Largest Complete Subgroup (All Nodes Connected) | MaxClique |
| Solver for MaxFlow | MaxFlow |
| Solver for Maximum Weighted Matching | MaxMatching |
| Solver for Minimum Cost Arborescence | MinCostArborescence |
| Solver for MinCostFlow | MinCostFlow |
| Solver for MinCut | MinCut |
| Solver for Minimum Mean Cycle | MinMeanCycle |
| Solver for Minimum Spanning Tree | MinSpanningTree |
| Solver for Network Circulation | NetworkCirculation |
| Check if Graph is Planar | PlanarChecking |
| Solver for Planar Coloring | PlanarColoring |
| Solver for Planar Drawing | PlanarDrawing |
| Solver for Planar Embedding | PlanarEmbedding |
| Solver for Shortest Path Between Two Nodes | ShortestPath |
| Solve for Shortest Path from Source Node to All Other Nodes | ShortestPathFromSource |
| A small network graph example | small_graph_example |
| Solver for Traveling Salesperson Problem | TravelingSalesperson TravellingSalesperson |
