public class AlgosMiscellaneous extends OperationGroup implements OperationDescFile
Modifier and Type | Class and Description |
---|---|
class |
AlgosMiscellaneous.AlgoBetweennessEdgeHistogram |
class |
AlgosMiscellaneous.AlgoBetweennessVertexHistogram |
class |
AlgosMiscellaneous.AlgoCompleteGraphEdges |
class |
AlgosMiscellaneous.AlgoDegeneracy |
class |
AlgosMiscellaneous.AlgoGetDominatingSet |
class |
AlgosMiscellaneous.AlgoGetDominatingSetSize |
class |
AlgosMiscellaneous.AlgoGetGreedyVertexCover |
class |
AlgosMiscellaneous.AlgoGetHIndexPlus |
class |
AlgosMiscellaneous.AlgoGetKCore |
class |
AlgosMiscellaneous.AlgoGetKCoreHistogram |
class |
AlgosMiscellaneous.AlgoGetKCoreSize |
class |
AlgosMiscellaneous.AlgoHIndex |
class |
AlgosMiscellaneous.AlgoNeighborhoodDiversity |
class |
AlgosMiscellaneous.AlgoTwoHopsHistogram |
class |
AlgosMiscellaneous.AlgoVertexCoverSizeBothHeuristics |
class |
AlgosMiscellaneous.ComplementaryGraph |
class |
AlgosMiscellaneous.IsBipartite |
ALGODIR, CMDSDIR, GROPDIR
Constructor and Description |
---|
AlgosMiscellaneous() |
Modifier and Type | Method and Description |
---|---|
<VertexType,EdgeType> |
get2ApproxVertexCover(GraphLibrary<VertexType,EdgeType> graph,
Progress progress) |
java.lang.String |
getDescriptionFilename()
Returns the filename of the description file containing a help entry for the operation.
|
<VertexType,EdgeType> |
getDominatingSet(GraphLibrary<VertexType,EdgeType> graph,
Progress progress,
boolean withReduction) |
<VertexType,EdgeType> |
getGreedyVertexCover(GraphLibrary<VertexType,EdgeType> graph,
Progress progress,
boolean withReduction) |
<VertexType,EdgeType> |
getKCore(GraphLibrary<VertexType,EdgeType> graph,
UserInterface userInterface,
int k) |
<VertexType,EdgeType> |
getNeighborDiversity(GraphLibrary<VertexType,EdgeType> graph,
Progress progress) |
GraphOperation[] |
getOperations()
Returns instances of all operations of the group.
|
<VertexType,EdgeType> |
hindexPlus(GraphLibrary<VertexType,EdgeType> graph,
UserInterface userInterface) |
<VertexType,EdgeType> |
ignore(GraphLibrary<VertexType,EdgeType> graph,
VertexType vt) |
<VertexType,EdgeType> |
isBipartite(GraphLibrary<VertexType,EdgeType> graph) |
<VertexType,EdgeType> |
nextColor(VertexType vt,
java.util.HashMap<VertexType,GColor> mapping) |
<VertexType,EdgeType> |
toComplementaryGraph(GraphLibrary<VertexType,EdgeType> graph,
Progress progress) |
public <VertexType,EdgeType> int hindexPlus(GraphLibrary<VertexType,EdgeType> graph, UserInterface userInterface)
public <VertexType,EdgeType> java.util.LinkedList<VertexType> getKCore(GraphLibrary<VertexType,EdgeType> graph, UserInterface userInterface, int k)
public <VertexType,EdgeType> int getGreedyVertexCover(GraphLibrary<VertexType,EdgeType> graph, Progress progress, boolean withReduction)
public <VertexType,EdgeType> int get2ApproxVertexCover(GraphLibrary<VertexType,EdgeType> graph, Progress progress)
public <VertexType,EdgeType> java.util.LinkedList<VertexType> getDominatingSet(GraphLibrary<VertexType,EdgeType> graph, Progress progress, boolean withReduction)
public <VertexType,EdgeType> boolean ignore(GraphLibrary<VertexType,EdgeType> graph, VertexType vt)
public <VertexType,EdgeType> int getNeighborDiversity(GraphLibrary<VertexType,EdgeType> graph, Progress progress)
public <VertexType,EdgeType> void toComplementaryGraph(GraphLibrary<VertexType,EdgeType> graph, Progress progress)
public <VertexType,EdgeType> GColor nextColor(VertexType vt, java.util.HashMap<VertexType,GColor> mapping)
public <VertexType,EdgeType> boolean isBipartite(GraphLibrary<VertexType,EdgeType> graph)
public GraphOperation[] getOperations()
OperationGroup
getOperations
in class OperationGroup
public java.lang.String getDescriptionFilename()
OperationDescFile
getDescriptionFilename
in interface OperationDescFile