operations.graphoperations.algorithms

Class AlgoCVDHeuristic.CVD<VertexType,EdgeType>

java.lang.Object

operations.graphoperations.algorithms.AlgoCVDHeuristic.CVD<VertexType,EdgeType>

Enclosing class:

AlgoCVDHeuristic

public class AlgoCVDHeuristic.CVD<VertexType,EdgeType>
extends java.lang.Object

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
class	AlgoCVDHeuristic.CVD.Result

Field Summary

Fields

Modifier and Type	Field and Description
boolean[]	deleted
java.util.HashMap<VertexType,java.lang.Integer>	fromVT
java.util.ArrayList<AlgoCVDHeuristic.P3>	p3s
java.util.ArrayList<java.lang.Integer>	res
java.util.HashMap<java.lang.Integer,VertexType>	toVT

Constructor Summary

Constructors

Constructor and Description
CVD(GraphLibrary<VertexType,EdgeType> graph)

Method Summary

Modifier and Type	Method and Description
void	addEdge(int node1, int node2)
java.util.ArrayList<VertexType>	convertToClusterGraph()
java.util.ArrayList<VertexType>	convertToClusterGraphQuicker()
java.util.ArrayList<VertexType>	convertToClusterGraphQuickest()
java.util.ArrayList<java.lang.Integer>	cvd_branch(int k)
java.util.ArrayList<java.lang.Integer>	cvd_branch2(int k)
void	deleteEdge(int node1, int node2)
void	deleteNode(int node)
AlgoCVDHeuristic.P3	findP3()
boolean	hasEdge(int node1, int node2)
java.util.ArrayList<AlgoCVDHeuristic.P3>	latePacking()
java.util.PriorityQueue<AlgoCVDHeuristic.Node>	noOfDistinctP3s(AlgoCVDHeuristic.P3 p3)
java.util.PriorityQueue<AlgoCVDHeuristic.Node2>	noOfDistinctP3s2(AlgoCVDHeuristic.P3 p3)
java.util.ArrayList<AlgoCVDHeuristic.P3>	packing()
java.util.ArrayList<AlgoCVDHeuristic.P3>	revpacking()
boolean	stillP3(AlgoCVDHeuristic.P3 p3)
void	undoDeleteNode(int node)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

fromVT

public java.util.HashMap<VertexType,java.lang.Integer> fromVT

toVT

public java.util.HashMap<java.lang.Integer,VertexType> toVT

res

public java.util.ArrayList<java.lang.Integer> res

deleted

public boolean[] deleted

p3s

public java.util.ArrayList<AlgoCVDHeuristic.P3> p3s

Constructor Detail

CVD

public CVD(GraphLibrary<VertexType,EdgeType> graph)

Method Detail

addEdge

public void addEdge(int node1,
                    int node2)

deleteEdge

public void deleteEdge(int node1,
                       int node2)

deleteNode

public void deleteNode(int node)

undoDeleteNode

public void undoDeleteNode(int node)

hasEdge

public boolean hasEdge(int node1,
                       int node2)

stillP3

public boolean stillP3(AlgoCVDHeuristic.P3 p3)

noOfDistinctP3s

public java.util.PriorityQueue<AlgoCVDHeuristic.Node> noOfDistinctP3s(AlgoCVDHeuristic.P3 p3)

noOfDistinctP3s2

public java.util.PriorityQueue<AlgoCVDHeuristic.Node2> noOfDistinctP3s2(AlgoCVDHeuristic.P3 p3)

packing

public java.util.ArrayList<AlgoCVDHeuristic.P3> packing()

revpacking

public java.util.ArrayList<AlgoCVDHeuristic.P3> revpacking()

latePacking

public java.util.ArrayList<AlgoCVDHeuristic.P3> latePacking()

findP3

public AlgoCVDHeuristic.P3 findP3()

cvd_branch

public java.util.ArrayList<java.lang.Integer> cvd_branch(int k)

cvd_branch2

public java.util.ArrayList<java.lang.Integer> cvd_branch2(int k)

convertToClusterGraphQuickest

public java.util.ArrayList<VertexType> convertToClusterGraphQuickest()

convertToClusterGraphQuicker

public java.util.ArrayList<VertexType> convertToClusterGraphQuicker()

convertToClusterGraph

public java.util.ArrayList<VertexType> convertToClusterGraph()