チェンジセット 1293

コミット日時:

2008/09/07 17:43:33 (4 ヶ月前)

コミッタ:

hael

ログメッセージ:

--

ファイル:

• as3/GameAI/trunk/src/jp/dip/hael/gameai/tree/Tree.as (更新) (4 diffs)

as3/GameAI/trunk/src/jp/dip/hael/gameai/tree/Tree.as

@@ -3 +3 @@
-        import jp.dip.hael.gameai.graph.Edge;
-        import jp.dip.hael.gameai.graph.Graph;
+        import jp.dip.hael.gameai.graph.Node;
-
-
@@ -35 +36 @@
-                {
-                        super(false);
-super.addNode(new TreeNode(-1
+addNode(new TreeNode(0
-                }
-                
@@ -41 +42 @@
-                public function addChild(parentIdx:int):int
-                {
-super.
+
-                        if(super.addEdge(new Edge(parentIdx, idx))){
-                                return idx;
@@ -50 +51 @@
-                
-                
-
+
+
+
-                {
-
-
-
-
+
-                        
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
-                                }
-b) addEdge(new Edge(i, c
+!exist) addEdge(new Edge(parent.index, target.index
-                        }
-                        
+                        return addedIdx;
+                }
+                
+                
+                public function idxBundle(parentIdx:int, targetIdx:int):int
+                {
+                        var addedIdx:int = -1;
+                        
+                        if(nodes_[targetIdx] == undefined){
+                                addedIdx = addNode(new Node(targetIdx));
+                                addEdge(new Edge(parentIdx, parentIdx));
+                        }else{
+                                var exist:Boolean = false;
+                                for each(var edge:Edge in edges_[parentIdx]){
+                                        if(edge.dst == targetIdx){
+                                                exist = true;
+                                                break;
+                                        }
+                                }
+                                if(!exist) addEdge(new Edge(parentIdx, targetIdx));
+                        }
+                        
+                        return addedIdx;
+                }
+                
+                
+                public function domino(set1:Array, ...rest):Array
+                {
+                        var addedIdxs:Array = [], added:int;
+                        
+                        var parent:TreeNode, target:TreeNode, childs:Array;
+                        var child:TreeNode;
+                        
+                        // set1 = [parent, target, childs[]]を追加
+                        parent = set1[0];
+                        target = set1[1];
+                        childs = set1[2];
+                        added = bundle(parent, target);
+                        if(added > 0) addedIdxs.push(added);
+                        for each(child in childs){
+                                added = bundle(target, child);
+                                if(added > 0) addedIdxs.push(added);
+                        }
+                        
+                        // rest = [set2, set3, ...]を追加
-                        for each(var r:Array in rest){
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
-                                }
-                        }
-                        
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
-                }
-