1 /*
2 * The contents of this file are subject to the BT "ZEUS" Open Source
3 * Licence (L77741), Version 1.0 (the "Licence"); you may not use this file
4 * except in compliance with the Licence. You may obtain a copy of the Licence
5 * from $ZEUS_INSTALL/licence.html or alternatively from
6 * http://www.labs.bt.com/projects/agents/zeus/licence.htm
7 *
8 * Except as stated in Clause 7 of the Licence, software distributed under the
9 * Licence is distributed WITHOUT WARRANTY OF ANY KIND, either express or
10 * implied. See the Licence for the specific language governing rights and
11 * limitations under the Licence.
12 *
13 * The Original Code is within the package zeus.*.
14 * The Initial Developer of the Original Code is British Telecommunications
15 * public limited company, whose registered office is at 81 Newgate Street,
16 * London, EC1A 7AJ, England. Portions created by British Telecommunications
17 * public limited company are Copyright 1996-9. All Rights Reserved.
18 *
19 * THIS NOTICE MUST BE INCLUDED ON ANY COPY OF THIS FILE
20 */
21
22
23
24 package zeus.agentviewer.engine;
25
26 import java.util.*;
27 import javax.swing.tree.*;
28 import zeus.util.Tree;
29
30
31 public class GraphTreeModel extends DefaultTreeModel {
32
33 private Tree graph;
34 //----------------------------------------------------------------------------
35 public GraphTreeModel(Tree graph) {
36 super(new DefaultMutableTreeNode(graph.getRoot()));
37 this.graph = graph;
38 createTree((DefaultMutableTreeNode)getRoot(),graph.getRoot());
39 reload();
40 }
41 //----------------------------------------------------------------------------
42 private void createTree(DefaultMutableTreeNode m_node,
43 zeus.util.TreeNode a_node) {
44
45 // takes contents of model and inserts them into the tree
46
47 Vector children = a_node.getChildren();
48 zeus.util.TreeNode b_node;
49 DefaultMutableTreeNode n_node;
50
51 for(int i = 0; i < children.size(); i++ ) {
52 b_node = (zeus.util.TreeNode)children.elementAt(i);
53 n_node = new DefaultMutableTreeNode(b_node);
54 m_node.add(n_node);
55 createTree(n_node,b_node);
56 }
57 }
58 }