day33

/**
     ********************************
     * Breadth first traversal.
     *
     * @param paraStartIndex The start index.
     * @return The sequence of the visit.
     ********************************
     */
    public String breadthFirstTraversal(int paraStartIndex){
        CircleObjectQueue tempQueue = new CircleObjectQueue();
        String resultString = "";

        int tempNumNodes = connectivityMatrix.getRows();
        boolean[] tempVisitedArray = new boolean[tempNumNodes];

        tempVisitedArray[paraStartIndex] = true;

        //Initialize the queue.
        //Visit before enqueue.
        tempVisitedArray[paraStartIndex] = true;
        resultString += paraStartIndex;
        tempQueue.enqueue(new Integer(paraStartIndex));

        //Now visit the rest of the graph.
        int tempIndex;
        Integer tempInteger = (Integer) tempQueue.dequeue();
        while(tempInteger != null){
            tempIndex = tempInteger.intValue();

            //Enqueue all its unvisited neighbors.
            for (int i = 0; i < tempNumNodes; i++) {
                if(tempVisitedArray[i]){
                    continue;
                    //Already visited.
                }//Of if

                if (connectivityMatrix.getData()[tempIndex][i] == 0){
                    continue;
                    //Not directly connected.
                }//Of if

                //Visit before enqueue.
                tempVisitedArray[i] = true;
                resultString += i;
                tempQueue.enqueue(new Integer(i));
            }//Of for i

            //Take out one from the head.
            tempInteger = (Integer) tempQueue.dequeue();
        }//Of while

        return resultString;
    }//Of breadthFirstTraversal

    /**
     ********************************
     * Unit test for breadthFirstTraversal.
     ********************************
     */
    public static void breadthFirstTraversalTest(){
        //Test an undirected graph.
        int[][] tempMatrix = { {0, 1, 1, 0}, {1, 0, 0, 1}, {1, 0, 0, 1}, {0, 1, 1, 0} };
        Graph tempGraph = new Graph(tempMatrix);
        System.out.println(tempGraph);

        String tempSequence = "";
        try{
            tempSequence = tempGraph.breadthFirstTraversal(2);
        }catch (Exception ee){
            System.out.println(ee);
        }//Of try.

        System.out.println("The breadth first order of visit: " + tempSequence);
    }//Of breadthFirstTraversalTest

    /**
     ********************************
     * The entrance of the program.
     *
     * @param args
     * Not used now.
     ********************************
     */
    public static void main(String[] args){
        Graph tempGraph = new Graph(3);
        System.out.println(tempGraph);

        //Unit test.
        getConnectivityTest();

        breadthFirstTraversalTest();
    }//Of main

}//Of class Graph

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值