it.unimi.dsi.law.graph
Class BFS

java.lang.Object
  it.unimi.dsi.law.graph.BFS

public class BFS
extends Object

Computes the visit order with respect to a depth-first visit.

Author:

Marco Rosa

Constructor Summary

BFS()

Method Summary

static int[]	bfsperm(ImmutableGraph graph, int startingNode, int[] startPerm) Return the permutation induced by the visit order of a depth-first visit.
static void	main(String[] args)

Methods inherited from class java.lang.Object

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

Constructor Detail

BFS

public BFS()

Method Detail

bfsperm

public static int[] bfsperm(ImmutableGraph graph,
                            int startingNode,
                            int[] startPerm)

Return the permutation induced by the visit order of a depth-first visit.

Parameters:

graph - a graph.

startingNode - the only starting node of the visit, or -1 for a complete visit.

startPerm - a permutation that will be used to shuffle successors.

Returns:

the permutation induced by the visit order of a depth-first visit.

main

public static void main(String[] args)
                 throws JSAPException,
                        IOException

Throws:

JSAPException

IOException