Final Algo Checklist
Closed this issue · 0 comments
atewari7 commented
For each finalized user interface, check it off when it is complete. Each user interface needs to meet the following standards:
- Source C++ Runners Implemented (not exported)
- Documentation Completed for Source C++ Runners (named after module)
- R Wrapper Implemented (exported, proper check functions, switch function includes runner options and stop("Invalid Algorithm"), name follows finalized naming)
- Documentation Follows Standards (EX: ##' @param arcSources Vector corresponding to the source nodes of a graph's edges, param 'algorithm' specifies default, description defines problem, description specifies graph input type (directed, undirected) )
- Tests for Source C++ Runners (functionality)
- Test for R Wrapper (invalid algorithm, functionality)
Approximation Module
- MaxClique
Connectivity Module
- GetBipartitePartitions
- GetAndCheckTopologicalSort
- GetTopologicalSort
- IsConnected
- IsAcyclic
- IsTree
- IsBipartite
- IsStronglyConnected
- IsDAG
- IsBiNodeConnected
- IsBiEdgeConnected
- IsLoopFree
- IsParallelFree
- IsSimpleGraph
- IsEulerian
- CountBiEdgeConnectedComponents
- CountConnectedComponents
- CountBiNodeConnectedComponents
- CountStronglyConnectedComponents
- FindStronglyConnectedComponents
- FindStronglyConnectedCutArcs
- FindBiEdgeConnectedCutEdges
- FindBiNodeConnectedComponents
- FindBiNodeConnectedCutNodes
- FindConnectedComponents
- FindBiEdgeConnectedComponents
Graph Search Module
- GraphSearch
- MaxCardinalitySearch
Max Flow Module
- NetworkCirculation
- MaxFlow
Max Matching Module
- MaxCardinalityMatching
- MaxWeightedMatching
Min Cost Flow Module
- MinCostFlow
Min Cut Module
- GomoryHuTree
- MinCut
Minimum Mean Cycle Module
- MinMeanCycle
Minimum Spanning Tree Module
- MinCostArborescence
- MinSpanningTree
Planarity Embedding Module
- PlanarEmbedding
- PlanarDrawing
- PlanarColoring
- IsPlanar
Shortest Path Module
- ShortestPath
- ShortestPathFromSource
Traveling Salesman Module
- TravelingSalesman