Man pages for rlemon
R Access to LEMON Graph Algorithms
| AllPairsMinCut | Solver for All-Pairs MinCut |
| CountBiEdgeConnectedComponents | Count Number of Bi-Edge-Connected Components |
| CountBiNodeConnectedComponents | Count Number of Bi-Node-Connected Components |
| CountConnectedComponents | Count the Number of Connected Components |
| CountStronglyConnectedComponents | Count the Number of Strongly Connected Components |
| FindBiEdgeConnectedComponents | Find Bi-Edge-Connected Components |
| FindBiEdgeConnectedCutEdges | Find Bi-Edge-Connected Cut Edges |
| FindBiNodeConnectedComponents | Find Bi-Node-Connected Components |
| FindBiNodeConnectedCutNodes | Find Bi-Node-Connected Cut Nodes |
| FindConnectedComponents | Find Connected Components |
| FindStronglyConnectedComponents | Find Strongly Connected Components |
| FindStronglyConnectedCutArcs | Find Strongly Connected Cut Arcs |
| GetAndCheckTopologicalSort | Check if Graph is DAG, then Sorts Nodes into Topological... |
| GetBipartitePartitions | Obtains (if possible) Bipartite Split |
| GetTopologicalSort | Sorts Nodes into Topological Order |
| GraphSearch | Solver for Graph Search |
| IsAcyclic | Check if Graph is Acyclic. |
| IsBiEdgeConnected | Chcek if Graph is Bi-Edge-Connected |
| IsBiNodeConnected | Checks if Graph is Bi-Node-Connected |
| IsBipartite | Checks if Graph is Bipartite |
| IsConnected | Check if Graph is Connected |
| IsDAG | Check if Graph is a DAG. |
| IsEulerian | Check if Graph is Eulerian |
| IsLoopFree | Checks if Graph is Loop Free |
| IsParallelFree | Check if Graph is Parallel Free |
| IsSimpleGraph | Check if Graph is Simple |
| IsStronglyConnected | Check if Graph is Strongly Connected |
| IsTree | Check if Graph is a Tree |
| lemon_runners | LEMON runners |
| MaxCardinalityMatching | Solve for Maximum Cardinality Matching |
| MaxCardinalitySearch | Solver for Max Cardinality Search |
| MaxClique | Solver for Largest Complete Subgroup (All Nodes Connected) |
| MaxFlow | Solver for MaxFlow |
| MaxMatching | Solver for Maximum Weighted Matching |
| MinCostArborescence | Solver for Minimum Cost Arborescence |
| MinCostFlow | Solver for MinCostFlow |
| MinCut | Solver for MinCut |
| MinMeanCycle | Solver for Minimum Mean Cycle |
| MinSpanningTree | Solver for Minimum Spanning Tree |
| NetworkCirculation | Solver for Network Circulation |
| PlanarChecking | Check if Graph is Planar |
| PlanarColoring | Solver for Planar Coloring |
| PlanarDrawing | Solver for Planar Drawing |
| PlanarEmbedding | Solver for Planar Embedding |
| 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 |
| TravelingSalesperson | Solver for Traveling Salesperson Problem |
