edu.gwu.algtest
Interface GraphPartitioningAlgorithm

All Superinterfaces:

edu.gwu.algtest.Algorithm

public interface GraphPartitioningAlgorithm

extends edu.gwu.algtest.Algorithm

Interface GraphPartitioningAlgorithm is to be implemented by graph partitioning algorithms.

See Also:

Algorithm

Method Summary
int[]	findPartition(double[][] adjMatrix)           Method findPartition should return vertices in one of the two sets.

 

Methods inherited from interface edu.gwu.algtest.Algorithm

getName, setPropertyExtractor

 

Method Detail

findPartition

public int[] findPartition(double[][] adjMatrix)

Method findPartition should return vertices in one of the two sets. The number of vertices in the returned set should be half the number in the graph. The value of the partition will be the total edge weight for those edges that go between the partitions.

Parameters:

adjMatrix - a double[][] value

Returns:

an int[] value