图的深度优先，广度优先

深度优先遍历

public Iterator<T> iteratorDFS(int startIndex)

   {

      Integer x;

      boolean found;

      LinkedStack<Integer> traversalStack = new LinkedStack<Integer>();

      ArrayUnorderedList<T> resultList = new ArrayUnorderedList<T>();

      boolean[] visited = new boolean[numVertices];

 

      if (!indexIsValid(startIndex))

         return resultList.iterator();

 

      for (int i = 0; i < numVertices; i++)

         visited[i] = false;

     

      traversalStack.push(new Integer(startIndex));

      resultList.addToRear(vertices[startIndex]);

      visited[startIndex] = true;

     

      while (!traversalStack.isEmpty())

      {

         x = traversalStack.peek();

         found = false;

 

         /** Find a vertex adjacent to x that has not been visited

             and push it on the stack */

         for (int i = 0; (i < numVertices) && !found; i++)

         {

            if (adjMatrix[x.intValue()][i] && !visited[i])

            {

               traversalStack.push(new Integer(i));

               resultList.addToRear(vertices[i]);

               visited[i] = true;

               found = true;

            }

         }

         if (!found && !traversalStack.isEmpty())

            traversalStack.pop();

      }

      return resultList.iterator();

   }

 

 

 

广度优先遍历

public Iterator<T> iteratorBFS(int startIndex)

   {

      Integer x;

      LinkedQueue<Integer> traversalQueue = new LinkedQueue<Integer>();

      ArrayUnorderedList<T> resultList = new ArrayUnorderedList<T>();

 

      if (!indexIsValid(startIndex))

         return resultList.iterator();

 

      boolean[] visited = new boolean[numVertices];

      for (int i = 0; i < numVertices; i++)

         visited[i] = false;

     

      traversalQueue.enqueue(new Integer(startIndex));

      visited[startIndex] = true;

     

      while (!traversalQueue.isEmpty())

      {

         x = traversalQueue.dequeue();

         resultList.addToRear(vertices[x.intValue()]);

 

         /** Find all vertices adjacent to x that have not been visited

             and queue them up */

         for (int i = 0; i < numVertices; i++)

         {

            if (adjMatrix[x.intValue()][i] && !visited[i])

            {

               traversalQueue.enqueue(new Integer(i));

               visited[i] = true;

            }

         }

      }

      return resultList.iterator();

   }