An overly simple breadth first search implementation.

BreadthFirstSearch.java

import java.util.Queue;
import java.util.List;
import java.util.LinkedList;
import java.util.ArrayList;

public class BreadthFirstSearch {
  public static void main(String args[]) {
    int[][] graph = { 
      { 0, 1, 2 },
      { 0, 1, 2 },
      { 0, 1, 2 },
    };  

    int target = BreadthFirstSearch.BFS(graph, 0, 2); 
    System.out.println(Integer.toString(target));
  }

  public static int BFS(int[][] G, int v, int target) {
    Queue<Integer> Q = new LinkedList<Integer>();   
    List<Integer> V = new ArrayList<Integer>();

    V.add(v);
    Q.add(v);

    while (!Q.isEmpty()) {
      int t = (int) Q.remove();

      if (t == target) {
        return t;
      }   

      for (int e: G[t]) {
        if (!V.contains(e)) {
          V.add(e); 
          Q.add(e);
        }
      }   
    }   

    return -1; 
  }
}