Modifier and Type | Class and Description |
---|---|
class |
GeneralizedMultiCoveringAlgorithm
Find MultiPackings of graphs.
|
class |
MultiCoveringAlgorithm
Find MultiPackings of graphs.
|
class |
MultiDecompositionAlgorithm
Find MultiDesigns of graphs.
|
class |
MultiDesignAlgorithm
Find MultiDesigns of graphs.
|
class |
MultiPackingAlgorithm
Find MultiPackings of graphs.
|
Modifier and Type | Class and Description |
---|---|
class |
EfficientPebbleAlgorithm |
class |
PebbleAlgorithm
The basis for all algorithms involving Graph Pebbling
|
Modifier and Type | Class and Description |
---|---|
class |
IsSolvableIslands
This class is based off of the IsSolvableDiam2Iterable class from the previous version of PebbleIt, and implements
the Islands Algorithm as explained in Pebbling Algorithms in Diameter Two Graphs.
|
class |
IsSolvableIslandsRecursive |
Modifier and Type | Class and Description |
---|---|
class |
MergePebbles
This is based on IsSolvableMergePebbles.
|
Modifier and Type | Class and Description |
---|---|
class |
PebblingNumberBottomUp
As of June 4, 2015, this is by far our fastest pebbling number algorithm.
|
class |
PebblingNumberForkJoin
The wrapper for the PebblingAlgorithmBottomUpForJoinTask.
|
class |
PebblingNumberRootedAllVertices
Runs PebblingNumberRootedBottomUp for all roots
|
class |
PebblingNumberRootedBottomUp
Determining the pebbling number of a single root--the last vertex by default.
|
class |
PebblingNumberRootedForkJoin |
Modifier and Type | Class and Description |
---|---|
class |
BacktrackingSolvabilitySomewhatEfficient
Insert comment here about what your algorithm does.
|
class |
FindAllUnsolvableConfigs
Return all of the unsolvable configurations of a graph for given values of p and q.
|
class |
IsSolvableBest |
class |
IsSolvableSomewhatExhaustiveEfficient
This is the class that uses the brute force algorithm to determine whether a particular pebbling puzzle is solvable
or not.
|
Modifier and Type | Class and Description |
---|---|
class |
IsSolvableShortestPath |
class |
IsSolvableShortestPebblePath |
class |
WeightFunctionCheck
Assumes the graph is connected.
|
Modifier and Type | Class and Description |
---|---|
class |
TwoPebblingAllViolators
A two pebbling algorithm that runs SingleQValueAllUnsolvable This class should really needs to use inheritence
better, though I didn't want to rewrite it all.
|
class |
TwoPebblingGeneric
A superclass for all of the 2PP algorithms.
|
class |
TwoPebblingProperty |
Modifier and Type | Class and Description |
---|---|
class |
CountShortestPathsAlgorithm |
Modifier and Type | Class and Description |
---|---|
class |
BreadthFirstSearchSkeletonAlgorithm
A skeleton Breadth First Search algorithm.
|
class |
ContainsCycle
Find cycles.
|
class |
ContainsTriangle |
class |
DepthFirstSearchSkeletonAlgorithm
A skeleton Depth First Search algorithm.
|
class |
EliminateDegree2Vertices |
class |
IsAntipodal
An Algorithm to check if a graph has the antipodal property (See "On Pebbling Graphs")
|
class |
IsBipartite |
class |
Prim
A class for the Prim Minimum Spanning Tree Algorithm
|
class |
ShortestPathAlgorithm |