public class AlgoFeedbackArcSet extends OperationGroup implements OperationDescFile
Modifier and Type | Class and Description |
---|---|
class |
AlgoFeedbackArcSet.AlgoCombFAS |
class |
AlgoFeedbackArcSet.AlgoCombFASSize |
class |
AlgoFeedbackArcSet.AlgoFVS2APX |
class |
AlgoFeedbackArcSet.AlgoFVS2APXSize |
class |
AlgoFeedbackArcSet.AlgoGetCycle |
class |
AlgoFeedbackArcSet.AlgoGetGR |
class |
AlgoFeedbackArcSet.AlgoGetGRSize |
class |
AlgoFeedbackArcSet.AlgoSCCCount |
class |
AlgoFeedbackArcSet.AlgoSifting |
class |
AlgoFeedbackArcSet.AlgoSiftingSize |
class |
AlgoFeedbackArcSet.Context |
class |
AlgoFeedbackArcSet.Index |
class |
AlgoFeedbackArcSet.InOut |
static class |
AlgoFeedbackArcSet.Status |
class |
AlgoFeedbackArcSet.UCycle |
ALGODIR, CMDSDIR, GROPDIR
Constructor and Description |
---|
AlgoFeedbackArcSet() |
Modifier and Type | Method and Description |
---|---|
<VertexType,EdgeType> |
cleanUp(DegreeLists<VertexType> degreeList) |
<VertexType,EdgeType> |
combFAS(GraphLibrary<VertexType,EdgeType> graph) |
<VertexType,EdgeType> |
cycleDFS(GraphLibrary<VertexType,EdgeType> graph) |
<VertexType,EdgeType> |
dfsVisit(GraphLibrary<VertexType,EdgeType> graph,
java.util.HashMap<VertexType,AlgoFeedbackArcSet.Status> mapping,
VertexType vt,
VertexType pred) |
<VertexType,EdgeType> |
fasGR(GraphLibrary<VertexType,EdgeType> graph,
UserInterface userInterface) |
<VertexType,EdgeType> |
findCycle(GraphLibrary<VertexType,EdgeType> graph) |
<VertexType,EdgeType> |
findCycle2(GraphLibrary<VertexType,EdgeType> graph) |
<VertexType,EdgeType> |
findCycleFAS(GraphLibrary<VertexType,EdgeType> graph) |
<VertexType,EdgeType> |
findDisjointCycle(DegreeLists<VertexType> degreeList,
GraphLibrary<VertexType,EdgeType> graph) |
<VertexType,EdgeType> |
findPosition(GraphLibrary<VertexType,EdgeType> graph,
VertexType vt) |
<VertexType,EdgeType> |
fvs2APX(GraphLibrary<VertexType,EdgeType> graph) |
<VertexType,EdgeType> |
getBackArcs(GraphLibrary<VertexType,EdgeType> graph) |
java.lang.String |
getDescriptionFilename()
Returns the filename of the description file containing a help entry for the operation.
|
Operation[] |
getOperations()
Returns instances of all operations of the group.
|
<VertexType,EdgeType> |
getSink(GraphLibrary<VertexType,EdgeType> graph) |
<VertexType,EdgeType> |
getSource(GraphLibrary<VertexType,EdgeType> graph) |
<VertexType,EdgeType> |
isSink(GraphLibrary<VertexType,EdgeType> graph,
VertexType vt) |
<VertexType,EdgeType> |
isSink2(GraphLibrary<VertexType,EdgeType> graph,
VertexType vt) |
<VertexType,EdgeType> |
isSource(GraphLibrary<VertexType,EdgeType> graph,
VertexType vt) |
<VertexType,EdgeType> |
isSource2(GraphLibrary<VertexType,EdgeType> graph,
VertexType vt) |
<VertexType,EdgeType> |
links(GraphLibrary<VertexType,EdgeType> graph,
VertexType vt) |
<VertexType,EdgeType> |
linksFAS(GraphLibrary<VertexType,EdgeType> graph,
VertexType vt) |
<VertexType,EdgeType> |
maxDelta(GraphLibrary<VertexType,EdgeType> graph) |
<VertexType,EdgeType> |
reverse(GraphLibrary<VertexType,EdgeType> graph,
java.util.LinkedList<VertexType> nodes) |
<VertexType,EdgeType> |
sifting(GraphLibrary<VertexType,EdgeType> graph,
java.util.LinkedList<VertexType> nodes) |
<VertexType,EdgeType> |
siftingR(GraphLibrary<VertexType,EdgeType> graph,
java.util.LinkedList<VertexType> nodes,
java.util.LinkedList<VertexType> rev) |
<VertexType,EdgeType> |
startSifting(GraphLibrary<VertexType,EdgeType> graph,
UserInterface userInterface) |
<VertexType,EdgeType> |
strongconnect(GraphLibrary<VertexType,EdgeType> graph,
VertexType vt,
java.util.ArrayDeque<VertexType> s,
java.util.HashMap<VertexType,AlgoFeedbackArcSet.Index> mapping,
java.util.HashSet<VertexType> inS) |
<VertexType,EdgeType> |
updateIngoingCounts(GraphLibrary<VertexType,EdgeType> graph,
VertexType vt) |
<VertexType,EdgeType> |
updateOutgoingCounts(GraphLibrary<VertexType,EdgeType> graph,
VertexType vt) |
<VertexType,EdgeType> |
updatePositions(GraphLibrary<VertexType,EdgeType> graph,
java.util.LinkedList<VertexType> nodes) |
<VertexType,EdgeType> |
walk2DegPath(DegreeLists<VertexType> degreeList,
GraphLibrary<VertexType,EdgeType> graph,
VertexType end,
VertexType start) |
public <VertexType,EdgeType> java.util.Vector<EdgeType> fasGR(GraphLibrary<VertexType,EdgeType> graph, UserInterface userInterface)
public <VertexType,EdgeType> void updateIngoingCounts(GraphLibrary<VertexType,EdgeType> graph, VertexType vt)
public <VertexType,EdgeType> void updateOutgoingCounts(GraphLibrary<VertexType,EdgeType> graph, VertexType vt)
public <VertexType,EdgeType> boolean isSink(GraphLibrary<VertexType,EdgeType> graph, VertexType vt)
public <VertexType,EdgeType> boolean isSink2(GraphLibrary<VertexType,EdgeType> graph, VertexType vt)
public <VertexType,EdgeType> boolean isSource(GraphLibrary<VertexType,EdgeType> graph, VertexType vt)
public <VertexType,EdgeType> boolean isSource2(GraphLibrary<VertexType,EdgeType> graph, VertexType vt)
public <VertexType,EdgeType> VertexType getSink(GraphLibrary<VertexType,EdgeType> graph)
public <VertexType,EdgeType> VertexType getSource(GraphLibrary<VertexType,EdgeType> graph)
public <VertexType,EdgeType> VertexType maxDelta(GraphLibrary<VertexType,EdgeType> graph)
public <VertexType,EdgeType> java.util.LinkedList<EdgeType> startSifting(GraphLibrary<VertexType,EdgeType> graph, UserInterface userInterface)
public <VertexType,EdgeType> java.util.LinkedList<VertexType> reverse(GraphLibrary<VertexType,EdgeType> graph, java.util.LinkedList<VertexType> nodes)
public <VertexType,EdgeType> void updatePositions(GraphLibrary<VertexType,EdgeType> graph, java.util.LinkedList<VertexType> nodes)
public <VertexType,EdgeType> java.util.LinkedList<VertexType> sifting(GraphLibrary<VertexType,EdgeType> graph, java.util.LinkedList<VertexType> nodes)
public <VertexType,EdgeType> java.util.LinkedList<VertexType> siftingR(GraphLibrary<VertexType,EdgeType> graph, java.util.LinkedList<VertexType> nodes, java.util.LinkedList<VertexType> rev)
public <VertexType,EdgeType> java.util.LinkedList<EdgeType> getBackArcs(GraphLibrary<VertexType,EdgeType> graph)
public <VertexType,EdgeType> int findPosition(GraphLibrary<VertexType,EdgeType> graph, VertexType vt)
public <VertexType,EdgeType> java.util.ArrayList<java.util.LinkedList<VertexType>> findCycle(GraphLibrary<VertexType,EdgeType> graph)
public <VertexType,EdgeType> java.util.ArrayList<java.util.LinkedList<VertexType>> strongconnect(GraphLibrary<VertexType,EdgeType> graph, VertexType vt, java.util.ArrayDeque<VertexType> s, java.util.HashMap<VertexType,AlgoFeedbackArcSet.Index> mapping, java.util.HashSet<VertexType> inS)
public <VertexType,EdgeType> java.util.Vector<EdgeType> combFAS(GraphLibrary<VertexType,EdgeType> graph)
public <VertexType,EdgeType> java.util.ArrayList<VertexType> findCycleFAS(GraphLibrary<VertexType,EdgeType> graph)
public <VertexType,EdgeType> java.util.ArrayDeque<VertexType> linksFAS(GraphLibrary<VertexType,EdgeType> graph, VertexType vt)
public <VertexType,EdgeType> java.util.ArrayList<VertexType> findCycle2(GraphLibrary<VertexType,EdgeType> graph)
public <VertexType,EdgeType> java.util.ArrayDeque<VertexType> links(GraphLibrary<VertexType,EdgeType> graph, VertexType vt)
public <VertexType,EdgeType> boolean cycleDFS(GraphLibrary<VertexType,EdgeType> graph)
public <VertexType,EdgeType> boolean dfsVisit(GraphLibrary<VertexType,EdgeType> graph, java.util.HashMap<VertexType,AlgoFeedbackArcSet.Status> mapping, VertexType vt, VertexType pred)
public <VertexType,EdgeType> java.util.ArrayList<VertexType> fvs2APX(GraphLibrary<VertexType,EdgeType> graph)
public <VertexType,EdgeType> void cleanUp(DegreeLists<VertexType> degreeList)
public <VertexType,EdgeType> java.util.HashSet<VertexType> findDisjointCycle(DegreeLists<VertexType> degreeList, GraphLibrary<VertexType,EdgeType> graph)
public <VertexType,EdgeType> java.util.HashSet<VertexType> walk2DegPath(DegreeLists<VertexType> degreeList, GraphLibrary<VertexType,EdgeType> graph, VertexType end, VertexType start)
public java.lang.String getDescriptionFilename()
OperationDescFile
getDescriptionFilename
in interface OperationDescFile
public Operation[] getOperations()
OperationGroup
getOperations
in class OperationGroup