Learn R Programming

rlemon (version 0.2.1)

R Access to LEMON Graph Algorithms

Description

Allows easy access to the LEMON Graph Library set of algorithms, written in C++. See the LEMON project page at . Current LEMON version is 1.3.1.

Copy Link

Version

Install

install.packages('rlemon')

Monthly Downloads

3,983

Version

0.2.1

License

BSL-1.0

Maintainer

Josh Errickson

Last Published

February 6th, 2023

Functions in rlemon (0.2.1)

IsBiEdgeConnected

Chcek if Graph is Bi-Edge-Connected
GetBipartitePartitions

Obtains (if possible) Bipartite Split
GetTopologicalSort

Sorts Nodes into Topological Order
IsBiNodeConnected

Checks if Graph is Bi-Node-Connected
IsBipartite

Checks if Graph is Bipartite
IsEulerian

Check if Graph is Eulerian
IsConnected

Check if Graph is Connected
IsSimpleGraph

Check if Graph is Simple
FindStronglyConnectedCutArcs

Find Strongly Connected Cut Arcs
IsParallelFree

Check if Graph is Parallel Free
IsLoopFree

Checks if Graph is Loop Free
IsDAG

Check if Graph is a DAG.
IsTree

Check if Graph is a Tree
IsStronglyConnected

Check if Graph is Strongly Connected
GraphSearch

Solver for Graph Search
MaxCardinalityMatching

Solve for Maximum Cardinality Matching
MaxCardinalitySearch

Solver for Max Cardinality Search
MinMeanCycle

Solver for Minimum Mean Cycle
MinSpanningTree

Solver for Minimum Spanning Tree
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
GrossoLocatelliPullanMcRunner

LEMON runners
MinCut

Solver for MinCut
MinCostFlow

Solver for MinCostFlow
small_graph_example

A small network graph example
PlanarChecking

Check if Graph is Planar
NetworkCirculation

Solver for Network Circulation
PlanarDrawing

Solver for Planar Drawing
PlanarColoring

Solver for Planar Coloring
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
TravelingSalesperson

Solver for Traveling Salesperson Problem
AllPairsMinCut

Solver for All-Pairs MinCut
FindBiNodeConnectedCutNodes

Find Bi-Node-Connected Cut Nodes
CountStronglyConnectedComponents

Count the Number of Strongly Connected Components
FindBiEdgeConnectedComponents

Find Bi-Edge-Connected Components
CountBiEdgeConnectedComponents

Count Number of Bi-Edge-Connected Components
CountBiNodeConnectedComponents

Count Number of Bi-Node-Connected Components
FindConnectedComponents

Find Connected Components
IsAcyclic

Check if Graph is Acyclic.
CountConnectedComponents

Count the Number of Connected Components
GetAndCheckTopologicalSort

Check if Graph is DAG, then Sorts Nodes into Topological Order
FindBiEdgeConnectedCutEdges

Find Bi-Edge-Connected Cut Edges
FindBiNodeConnectedComponents

Find Bi-Node-Connected Components
FindStronglyConnectedComponents

Find Strongly Connected Components