root/as3/GameAI/trunk/src/GraphTest.as

package
{
        import flash.display.Sprite;
        import flash.utils.getTimer;
        
        import jp.dip.hael.gameai.graph.Graph;
        import jp.dip.hael.gameai.graph.Node;
        import jp.dip.hael.gameai.graph.WeightedEdge;
        import jp.dip.hael.gameai.graph.searcher.BFS;
        import jp.dip.hael.gameai.graph.searcher.Dijkstra;
        import jp.dip.hael.gameai.util.PriorityQueueDsc;
        import jp.dip.hael.gameai.util.Rand;
        

        /**
         * @private
         */
        public class GraphTest extends Sprite
        {
                public function GraphTest()
                {
                        
                        var g:Graph = new Graph();
                        g.addNode(new Node(1));
                        g.addNode(new Node(2));
                        g.addNode(new Node(3));
                        g.addNode(new Node(4));
                        g.addNode(new Node(5));
                        g.addNode(new Node(6));
                        g.addEdge(new WeightedEdge(5, 2, 19));
                        g.addEdge(new WeightedEdge(5, 6, 30));
                        g.addEdge(new WeightedEdge(1, 5, 29));
                        g.addEdge(new WeightedEdge(1, 6, 10));
                        g.addEdge(new WeightedEdge(3, 5,  8));
                        g.addEdge(new WeightedEdge(6, 4, 11));
                        g.addEdge(new WeightedEdge(4, 3, 37));
                        g.addEdge(new WeightedEdge(2, 3, 31));
                        
                        var d:Dijkstra = new Dijkstra(g);
                        var t:int = getTimer();
                        for(var i:int = 0; i < 1000; i++){
                                d.search(5, 3);
                        }
                        trace(getTimer() - t);
//                      for each(var e:Edge in d.pathRef){
//                              trace(e.src + "->" + e.dst);
//                      }
                        var b:BFS = new BFS(g);
                        t = getTimer();
                        for(i = 0; i < 1000; i++){
                                b.search(5, 3);
                        }
                        trace(getTimer() - t);
//                      for each(var e:Edge in b.pathRef){
//                              trace(e.src + "->" + e.dst);
//                      }
                        
                        
//                      var pq:PriorityQueueDsc = new PriorityQueueDsc();
//                      t = getTimer();
//                      for(i = 0; i < 10000; i++){
//                              pq.insert(i, Rand.intRange(0, 100));
//                      }
//                      trace(getTimer() - t);
//                      var pq2:PriorityQueueDsc2 = new PriorityQueueDsc2();
//                      t = getTimer();
//                      for(i = 0; i < 10000; i++){
//                              pq2.insert(i, Rand.intRange(0, 100));
//                      }
//                      trace(getTimer() - t);
                }

        }
}