R Access to LEMON Graph Algorithms
![[R logo]](../../../doc/html/Rlogo.svg)
![[Up]](../../../doc/html/left.jpg)
![[Top]](../../../doc/html/up.jpg)
Documentation for package ‘rlemon’ version 0.2.1
Help Pages
A B C D E F G H I K L M N O P S T
-- A --
| AllPairsMinCut | Solver for All-Pairs MinCut |
-- B --
| BellmanFordRunner | LEMON runners |
| BfsRunner | LEMON runners |
-- C --
| CapacityScalingRunner | LEMON runners |
| ChristofidesRunner | LEMON runners |
| CirculationRunner | LEMON runners |
| CostScalingRunner | LEMON runners |
| CountBiEdgeConnectedComponents | Count Number of Bi-Edge-Connected Components |
| CountBiEdgeConnectedComponentsRunner | LEMON runners |
| CountBiNodeConnectedComponents | Count Number of Bi-Node-Connected Components |
| CountBiNodeConnectedComponentsRunner | LEMON runners |
| CountConnectedComponents | Count the Number of Connected Components |
| CountConnectedComponentsRunner | LEMON runners |
| CountStronglyConnectedComponents | Count the Number of Strongly Connected Components |
| CountStronglyConnectedComponentsRunner | LEMON runners |
| CycleCancellingRunner | LEMON runners |
-- D --
| DfsRunner | LEMON runners |
| DijkstraRunner | LEMON runners |
-- E --
| EdmondsKarpRunner | LEMON runners |
-- F --
| FindBiEdgeConnectedComponents | Find Bi-Edge-Connected Components |
| FindBiEdgeConnectedComponentsRunner | LEMON runners |
| FindBiEdgeConnectedCutEdges | Find Bi-Edge-Connected Cut Edges |
| FindBiEdgeConnectedCutEdgesRunner | LEMON runners |
| FindBiNodeConnectedComponents | Find Bi-Node-Connected Components |
| FindBiNodeConnectedComponentsRunner | LEMON runners |
| FindBiNodeConnectedCutNodes | Find Bi-Node-Connected Cut Nodes |
| FindBiNodeConnectedCutNodesRunner | LEMON runners |
| FindConnectedComponents | Find Connected Components |
| FindConnectedComponentsRunner | LEMON runners |
| FindStronglyConnectedComponents | Find Strongly Connected Components |
| FindStronglyConnectedComponentsRunner | LEMON runners |
| FindStronglyConnectedCutArcs | Find Strongly Connected Cut Arcs |
| FindStronglyConnectedCutArcsRunner | LEMON runners |
-- G --
| GetAndCheckTopologicalSort | Check if Graph is DAG, then Sorts Nodes into Topological Order |
| getAndCheckTopologicalSortRunner | LEMON runners |
| GetBipartitePartitions | Obtains (if possible) Bipartite Split |
| getBipartitePartitionsRunner | LEMON runners |
| GetTopologicalSort | Sorts Nodes into Topological Order |
| getTopologicalSortRunner | LEMON runners |
| GomoryHuTreeRunner | LEMON runners |
| GraphCompatabilityConverter | LEMON runners |
| GraphSearch | Solver for Graph Search |
| GreedyTSPRunner | LEMON runners |
| GrossoLocatelliPullanMcRunner | LEMON runners |
-- H --
| HaoOrlinRunner | LEMON runners |
| HartmannOrlinMmcRunner | LEMON runners |
| HowardMmcRunner | LEMON runners |
-- I --
| InsertionTSPRunner | LEMON runners |
| IsAcyclic | Check if Graph is Acyclic. |
| IsAcyclicRunner | LEMON runners |
| IsBiEdgeConnected | Chcek if Graph is Bi-Edge-Connected |
| IsBiEdgeConnectedRunner | LEMON runners |
| IsBiNodeConnected | Checks if Graph is Bi-Node-Connected |
| IsBiNodeConnectedRunner | LEMON runners |
| IsBipartite | Checks if Graph is Bipartite |
| IsBipartiteRunner | LEMON runners |
| IsConnected | Check if Graph is Connected |
| IsConnectedRunner | LEMON runners |
| IsDAG | Check if Graph is a DAG. |
| IsDAGRunner | LEMON runners |
| IsEulerian | Check if Graph is Eulerian |
| IsEulerianRunner | LEMON runners |
| IsLoopFree | Checks if Graph is Loop Free |
| IsLoopFreeRunner | LEMON runners |
| IsParallelFree | Check if Graph is Parallel Free |
| IsParallelFreeRunner | LEMON runners |
| IsSimpleGraph | Check if Graph is Simple |
| IsSimpleGraphRunner | LEMON runners |
| IsStronglyConnected | Check if Graph is Strongly Connected |
| IsStronglyConnectedRunner | LEMON runners |
| IsTree | Check if Graph is a Tree |
| IsTreeRunner | LEMON runners |
-- K --
| KarpMmcRunner | LEMON runners |
| KruskalRunner | LEMON runners |
-- L --
| lemon_runners | LEMON runners |
-- M --
| MaxCardinalityMatching | Solve for Maximum Cardinality Matching |
| MaxCardinalitySearch | Solver for Max Cardinality Search |
| MaxCardinalitySearchRunner | LEMON runners |
| MaxClique | Solver for Largest Complete Subgroup (All Nodes Connected) |
| MaxFlow | Solver for MaxFlow |
| MaximumCardinalityFractionalMatchingRunner | LEMON runners |
| MaximumCardinalityMatchingRunner | LEMON runners |
| MaximumWeightFractionalMatchingRunner | LEMON runners |
| MaximumWeightFractionalPerfectMatchingRunner | LEMON runners |
| MaximumWeightMatchingRunner | LEMON runners |
| MaximumWeightPerfectMatchingRunner | LEMON runners |
| MaxMatching | Solver for Maximum Weighted Matching |
| MinCostArborescence | Solver for Minimum Cost Arborescence |
| MinCostArborescenceRunner | LEMON runners |
| MinCostFlow | Solver for MinCostFlow |
| MinCut | Solver for MinCut |
| MinMeanCycle | Solver for Minimum Mean Cycle |
| MinSpanningTree | Solver for Minimum Spanning Tree |
-- N --
| NagamochiIbarakiRunner | LEMON runners |
| NearestNeighborTSPRunner | LEMON runners |
| NetworkCirculation | Solver for Network Circulation |
| NetworkSimplexRunner | LEMON runners |
-- O --
| Opt2TSPRunner | LEMON runners |
-- P --
| PlanarChecking | Check if Graph is Planar |
| PlanarCheckingRunner | LEMON runners |
| PlanarColoring | Solver for Planar Coloring |
| PlanarColoringRunner | LEMON runners |
| PlanarDrawing | Solver for Planar Drawing |
| PlanarDrawingRunner | LEMON runners |
| PlanarEmbedding | Solver for Planar Embedding |
| PlanarEmbeddingRunner | LEMON runners |
| PreflowRunner | LEMON runners |
-- S --
| ShortestPath | Solver for Shortest Path Between Two Nodes |
| ShortestPathFromSource | Solve for Shortest Path from Source Node to All Other Nodes |
| small_graph_example | A small network graph example |
| SuurballeRunner | LEMON runners |
-- T --
| TravelingSalesperson | Solver for Traveling Salesperson Problem |
| TravellingSalesperson | Solver for Traveling Salesperson Problem |