public boolean execute()
{
	updateGraph();
	if (!trace)
		rp.reset(g.size());
	else
		nextnode = 0;
	final int nn = (n < 0 ? Network.size() : n);
	if (method.equals("stats")) {
		IncrementalStats stats = new IncrementalStats();
		for (int i = 0; i < nn; ++i)
			stats.add(nextDegree());
		System.out.println(name + ": " + stats);
	} else if (method.equals("freq")) {
		IncrementalFreq stats = new IncrementalFreq();
		for (int i = 0; i < nn; ++i)
			stats.add(nextDegree());
		stats.print(System.out);
		System.out.println("\n\n");
	} else if (method.equals("list")) {
		System.out.print(name + ": ");
		for (int i = 0; i < nn; ++i)
			System.out.print(nextDegree() + " ");
		System.out.println();
	}
	return false;
}