Method main

misc/java_jni_wrapper/KaHIPWrapper.java:58–80

(String[] args)

	}

	public static void main(String[] args) {
		// example: partition the graph in figure 4 of the KaHIP documentation
		int n                   = 5;
		int[] vwgt              = new int[0];
		int[] xadj              = new int[] {0, 2, 5, 7, 9, 12};
		int[] adjcwgt           = new int[0];
		int[] adjncy            = new int[] {1, 4, 0, 2, 4, 1, 3, 2, 4, 0, 1, 3};
		int nparts              = 2;
		double imbalance        = 0.4;
		boolean suppress_output = false;
		int seed                = 123456;
		int mode                = KaHIPWrapper.KAHIP_STRONG;

		KaHIPWrapperResult result = KaHIPWrapper.kaffpa(n, vwgt, xadj, adjcwgt, adjncy, 
								nparts, imbalance, suppress_output, seed, mode);

		System.out.println("=======\nResult:\n=======");

		System.out.println("edce cut = " + result.getEdgecut());
		System.out.println("Partitions:");
		for (int i=0; i<result.getPart().length; i++) 
			System.out.println("\tNode " + i + " belongs to block " + result.getPart()[i]);
	}

}