Package vg.core.graph

Examples of vg.core.graph.GraphNode

80
81
82
83
84
85
86
87
88
89
90
91
92
      TreeModel tm = this.tree.getModel();
      if(tm == null) {
        VisualGraph.log.printDebug("[" + this.getClass().getName()+".actionPerformed] [BAD] Openning of subgraph in new tab(from navigator). Model = null.");
        return;
      } else {
        GraphNode node = ((GraphNode)tm.getRoot()).getNode(p[0]);
        if(node.getInnerGraph() != null) {
          StorableSubGraph ssg = this.model.getStorableSubGraph(node.getInnerGraph());
          IGraphView igv = GraphView.newGraphView(ssg, this.userInterface);
          UIRequestOpenSubGraph req = new UIRequestOpenSubGraph(igv, null);
          this.userInterface.addRequest(req);
        } else {
          VisualGraph.windowMessage.warningMessage("Selection should be subgraph, if you want to open subgraph in new tab", "Opening of subgraph");       
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
112
    if(this.tree != null) {
      TreePath[] p = this.tree.getSelectionPaths();
      if(p != null && p.length == 1) {
        TreeModel tm = this.tree.getModel();
        if(tm != null) {
          GraphNode node = ((GraphNode)tm.getRoot()).getNode(p[0]);
          if(node.getInnerGraph() != null) {
            return(true);
          }
        }
      }
    }
View Full Code Here
83
84
85
86
87
88
89
90
91
92
93
94
95
        VisualGraph.log.printDebug("[" + this.getClass().getName()+".actionPerformed] [BAD] Openning of composition of vertexes in new tab(from navigator). Model = null.");
        return;
      } else {
        ArrayList<Integer>vertexes = new ArrayList<Integer>();
        for(int i = 0 ; i < p.length ; i++) {
          GraphNode node = ((GraphNode)tm.getRoot()).getNode(p[i]);
          if(node.getType() == ENodeType.DEF_VERTEX) {
            int db_id = node.getStorableId();
            vertexes.add(db_id);
          } else {
            VisualGraph.log.printDebug("[" + this.getClass().getName()+".actionPerformed] [BAD] Openning of composition of vertexes in new tab(from navigator). Type of node is not DEF_VERTEX.");
            VisualGraph.windowMessage.warningMessage("Warning: Elements aren't vertex of graph(May be it is tab or tabs).", "Opening of vertexes");
            return;
View Full Code Here
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
      TreePath[] p = this.tree.getSelectionPaths();
      if(p != null) {
        if(p.length == 1) {
          TreeModel tm = this.tree.getModel();
          if(tm != null) {
            GraphNode node = ((GraphNode)tm.getRoot()).getNode(p[0]);
            if(node != null && node.getType() == ENodeType.DEF_VERTEX) {
              return(true);
            }
          }
        } else if(p.length > 0) {
          TreePath path = p[0].getParentPath();
          if(path != null) {
            TreeModel tm = this.tree.getModel();
            if(tm != null) {
              String s = path.toString();
              boolean check = false; // check all selected nodes, that they have one parent
              for(int i = 0 ; i < p.length ; i++) {
                GraphNode node = ((GraphNode)tm.getRoot()).getNode(p[i]);
                if(!s.equals(p[i].getParentPath().toString()) || node == null || node.getType() != ENodeType.DEF_VERTEX) {
                  check = true;
                  break;
                }
              }
              return(!check);
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
                TreePath tp3 = SearchTree.this.tree.getSelectionPath();
                if(tp3 == null) return(false);
                TreePath tp2 = tp3.getParentPath();
                if(tp2 == null) return(false);
                TreePath tp1 = tp2.getParentPath();
                GraphNode node3 = SearchTree.this.currNode.getNode(tp3);
                GraphNode node2 = SearchTree.this.currNode.getNode(tp2);
                GraphNode node1 = SearchTree.this.currNode.getNode(tp1);
                boolean workDone = false;
                for(int i = 0; i < node2.getChildCount(); i++) {
                  GraphNode buf = (GraphNode)node2.getChildAt(i);
                  if(buf == node3) {
                    if(i < node2.getChildCount() - 1) {
                      buf = (GraphNode)node2.getChildAt(i+1);
                      Object[] newPath = new Object[tp2.getPathCount() + 1];
                      System.arraycopy(tp2.getPath(), 0, newPath, 0, tp2.getPathCount());
                      newPath[tp2.getPathCount()] = buf;
                      TreePath newTP = new TreePath(newPath);
                      SearchTree.this.tree.setSelectionPath(newTP);
                      workDone = true;
                    }
                    break;
                  }
                }
                if(!workDone && node1 != null) {
                  for(int i = 0; i < node1.getChildCount() - 1; i++) {
                    GraphNode buf = (GraphNode)node1.getChildAt(i);
                    if(buf == node2) {
                      for(int j = i+1; j < node1.getChildCount(); j++) {
                        buf = (GraphNode)node1.getChildAt(j);
                        if(!buf.isLeaf()) {
                          GraphNode bufInner = (GraphNode)buf.getChildAt(0);
                          Object[] newPath = new Object[tp1.getPathCount() + 2];
                          System.arraycopy(tp1.getPath(), 0, newPath, 0, tp1.getPathCount());
                          newPath[tp1.getPathCount()] = buf;
                          newPath[tp1.getPathCount() + 1] = bufInner;
                          TreePath newTP = new TreePath(newPath);
                          SearchTree.this.tree.setSelectionPath(newTP);
                          break;
                        }
                      }
                      break;
                    }
                  }                   
                }
              }
            }
            return(true);
          } else if(e.getID() == KeyEvent.KEY_PRESSED && e.getKeyCode() == KeyEvent.VK_UP) {
            synchronized (SearchTree.this.theMutexObject) {
              if(SearchTree.this.currNode != null) {
                TreePath tp3 = SearchTree.this.tree.getSelectionPath();
                if(tp3 == null) return(false);
                TreePath tp2 = tp3.getParentPath();
                if(tp2 == null) return(false);
                TreePath tp1 = tp2.getParentPath();
                GraphNode node3 = SearchTree.this.currNode.getNode(tp3);
                GraphNode node2 = SearchTree.this.currNode.getNode(tp2);
                GraphNode node1 = SearchTree.this.currNode.getNode(tp1);
                boolean workDone = false;
                for(int i = 0; i < node2.getChildCount(); i++) {
                  GraphNode buf = (GraphNode)node2.getChildAt(i);
                  if(buf == node3) {
                    if(i > 0) {
                      buf = (GraphNode)node2.getChildAt(i-1);
                      Object[] newPath = new Object[tp2.getPathCount() + 1];
                      System.arraycopy(tp2.getPath(), 0, newPath, 0, tp2.getPathCount());
                      newPath[tp2.getPathCount()] = buf;
                      TreePath newTP = new TreePath(newPath);
                      SearchTree.this.tree.setSelectionPath(newTP);
                      workDone = true;
                    }
                    break;
                  }
                }
                if(!workDone && node1 != null) {
                  for(int i = 1; i < node1.getChildCount(); i++) {
                    GraphNode buf = (GraphNode)node1.getChildAt(i);
                    if(buf == node2) {
                      for(int j = i-1; j >= 0; j--) {
                        buf = (GraphNode)node1.getChildAt(j);
                        if(!buf.isLeaf()) {
                          GraphNode bufInner = (GraphNode)buf.getChildAt(buf.getChildCount() - 1);
                          Object[] newPath = new Object[tp1.getPathCount() + 2];
                          System.arraycopy(tp1.getPath(), 0, newPath, 0, tp1.getPathCount());
                          newPath[tp1.getPathCount()] = buf;
                          newPath[tp1.getPathCount() + 1] = bufInner;
                          TreePath newTP = new TreePath(newPath);
View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
83
84
      TreeModel tm = this.tree.getModel();
      if(tm == null) {
        VisualGraph.log.printDebug("[" + this.getClass().getName()+".actionPerformed] [BAD] Select tab(from navigator). Model = null.");
        return;
      } else {
        GraphNode node = ((GraphNode)tm.getRoot()).getNode(p[0]);
        if(node.getType() == ENodeType.DEF_TAB) {
          UIRequestSelectTab request = new UIRequestSelectTab(node.getStorableId(), null);
          this.userInterface.addRequest(request);
        } else {
          VisualGraph.windowMessage.warningMessage("Selection should be tab, if you want to select this tab", "Select tab");       
        }
      }
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
102
    if(this.tree != null) {
      TreePath[] p = this.tree.getSelectionPaths();
      if(p != null && p.length == 1) {
        TreeModel tm = this.tree.getModel();
        if(tm != null) {
          GraphNode node = ((GraphNode)tm.getRoot()).getNode(p[0]);
          if(node.getType() == ENodeType.DEF_TAB) {
            return(true);
          }
        }
      }
    }
View Full Code Here
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
    Component returnValue = delegate.getTreeCellRendererComponent(tree, value, selected, expanded, leaf, row, hasFocus);
    if (delegate instanceof JLabel)
    {
      JLabel renderer = (JLabel) delegate;
      if ((value != null) && (value instanceof GraphNode)) {
        GraphNode node = (GraphNode)value;
        switch(node.getType()) {
          case DEF_VERTEX:
          {
            if(!node.isLeaf()) {
              renderer.setIcon(this.routineIcon);
            } else {
              renderer.setIcon(this.vertexIcon);
            }
            renderer.addMouseListener(new MouseAdapter() {
View Full Code Here
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
    TreeCellRenderer delegate = new JTree().getCellRenderer();
    Component returnValue = delegate.getTreeCellRendererComponent(tree, value, selected, expanded, leaf, row, hasFocus);
    if (delegate instanceof JLabel) {
      JLabel renderer = (JLabel) delegate;
      if ((value != null) && (value instanceof GraphNode)) {
        GraphNode node = (GraphNode)value;
        switch(node.getType()) {
          case DEF_VERTEX:
          {
            if(!node.isLeaf()) {
              renderer.setIcon(this.routineIcon);
            } else {
              if(!array.contains(node.getStorableId())) {
                renderer.setIcon(this.iconDelete);
              } else {
                renderer.setIcon(this.vertexIcon);
              }
            }
View Full Code Here
88
89
90
91
92
93
94
95
96
97
98
99
100
      TreeModel tm = this.tree.getModel();
      if(tm == null) {
        VisualGraph.log.printDebug("[" + this.getClass().getName()+".actionPerformed] [BAD] Openning of subgraph in new tab(from navigator). Model = null.");
        return;
      } else {
        GraphNode node = ((GraphNode)tm.getRoot()).getNode(p[0]);
        if(node.getInnerGraph() != null) {
          StorableSubGraph ssg = this.parameter.model.getStorableSubGraph(node.getInnerGraph());
          IGraphView igv = GraphView.newGraphView(ssg, this.parameter.userInterface);
          showAdditionalAttribute(igv);
          if(this.model.getActionMode() == SearchPanelModel.DEF_ACTION_MODE_1) {
            UIRequestOpenSubGraph req = new UIRequestOpenSubGraph(igv, null);
            this.parameter.userInterface.addRequest(req);
View Full Code Here
TOP

Related Classes of vg.core.graph.GraphNode

  • vg.model.SQLite4JavaModel
  • vg.model.SQLiteModel
  • vg.modules.search.components.searchTree.components.OpenSubGraphAction
  • vg.modules.search.components.searchTree.components.OpenVerticesAction
  • vg.modules.search.components.searchTree.SearchTree
  • vg.modules.search.components.searchTree.SearchTreeRenderer
  • vg.modules.search.SearchPanel
  • vg.userInterface.navigator.components.OpenSubGraphAction
  • vg.userInterface.navigator.components.OpenVerticesAction
  • vg.userInterface.navigator.components.SelectionTabAction
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.