## Algorithm Solvers

AllPairsMinCut()
Solver for All-Pairs MinCut
GraphSearch()
Solver for Graph Search
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
ShortestPath()
Solver for Shortest Path Between Two Nodes
ShortestPathFromSource()
Solve for Shortest Path from Source Node to All Other Nodes
TravelingSalesperson() TravellingSalesperson()
Solver for Traveling Salesperson Problem

## Graph Attributes Checks

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

## Graph Attribute Extractors

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 Order
GetBipartitePartitions()
Obtains (if possible) Bipartite Split
GetTopologicalSort()
Sorts Nodes into Topological Order

## Planar Graph Functions

PlanarChecking()
Check if Graph is Planar
PlanarColoring()
Solver for Planar Coloring
PlanarDrawing()
Solver for Planar Drawing
PlanarEmbedding()
Solver for Planar Embedding

## Internal Runners

GrossoLocatelliPullanMcRunner() getBipartitePartitionsRunner() getAndCheckTopologicalSortRunner() getTopologicalSortRunner() IsConnectedRunner() IsAcyclicRunner() IsTreeRunner() IsBipartiteRunner() IsStronglyConnectedRunner() IsDAGRunner() IsBiNodeConnectedRunner() IsBiEdgeConnectedRunner() IsLoopFreeRunner() IsParallelFreeRunner() IsSimpleGraphRunner() IsEulerianRunner() CountBiEdgeConnectedComponentsRunner() CountConnectedComponentsRunner() CountBiNodeConnectedComponentsRunner() CountStronglyConnectedComponentsRunner() FindStronglyConnectedComponentsRunner() FindStronglyConnectedCutArcsRunner() FindBiEdgeConnectedCutEdgesRunner() FindBiNodeConnectedComponentsRunner() FindBiNodeConnectedCutNodesRunner() FindConnectedComponentsRunner() FindBiEdgeConnectedComponentsRunner() GraphCompatabilityConverter() BfsRunner() DfsRunner() MaxCardinalitySearchRunner() CirculationRunner() PreflowRunner() EdmondsKarpRunner() MaximumWeightPerfectMatchingRunner() MaximumWeightFractionalPerfectMatchingRunner() MaximumWeightFractionalMatchingRunner() MaximumWeightMatchingRunner() MaximumCardinalityMatchingRunner() MaximumCardinalityFractionalMatchingRunner() CycleCancellingRunner() CapacityScalingRunner() CostScalingRunner() NetworkSimplexRunner() NagamochiIbarakiRunner() HaoOrlinRunner() GomoryHuTreeRunner() HowardMmcRunner() KarpMmcRunner() HartmannOrlinMmcRunner() KruskalRunner() MinCostArborescenceRunner() PlanarCheckingRunner() PlanarEmbeddingRunner() PlanarColoringRunner() PlanarDrawingRunner() SuurballeRunner() DijkstraRunner() BellmanFordRunner() ChristofidesRunner() GreedyTSPRunner() InsertionTSPRunner() NearestNeighborTSPRunner() Opt2TSPRunner() lemon_runners()
LEMON runners

## Data

small_graph_example
A small network graph example