Package org.patika.mada.graph

Examples of org.patika.mada.graph.Node

62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
    {
      Object model = ((EditPart)selectedObjects.next()).getModel();

      if (model instanceof Node)
      {
        Node node = (Node) model;

        if (node instanceof ComplexMember)
        {
          node = node.getParents().iterator().next();
        }

        selectedNodes.add(node);
      }
    }
View Full Code Here
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
  {
    for (Object o : pgraph.getNodes())
    {
      if (o instanceof Node)
      {
        Node node = (Node) o;

        for (XRef ref : refs)
        {
          if (node.getReferences().contains(ref))
          {
            node.setHighlight(true);
          }
        }
      }
    }
  }
View Full Code Here
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
    // Process the queue

    while (!queue.isEmpty())
    {
      Node current = queue.remove(0);

      // Process edges towards the direction

      for (Edge edge : isFwd ? current.getDownstream() : current.getUpstream())
      {
        // Label the edge considering direction of traversal and type of current node

        if (isFwd || !current.isBreadthNode())
        {
          setLabel(edge, getLabel(current));
        }
        else
        {
          setLabel(edge, getLabel(current) + 1);
        }

        // Get the other end of the edge
        Node neigh = isFwd ? edge.getTargetNode() : edge.getSourceNode();

        // Process the neighbor if not processed or not in queue

        if (getColor(neigh) == WHITE)
        {
          // Label the neighbor according to the search direction and node type

          if (!neigh.isBreadthNode() || !isFwd)
          {
            setLabel(neigh, getLabel(edge));
          }
          else
          {
            setLabel(neigh, getLabel(current) + 1);
          }

          // Check if we need to stop traversing the neighbor, enqueue otherwise
         
          if ((stopSet == null || !stopSet.contains(neigh)) &&
            (!neigh.isBreadthNode() || getLabel(neigh) < limit))
          {
            setColor(neigh, GRAY);

            // Enqueue the node according to its type

            if (neigh.isBreadthNode())
            {
              queue.addLast(neigh);
            }
            else
            {
View Full Code Here
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
          int previousShortestDist;
          //shortest distance from current BFS
          int currentShortestDist;

          //element of resultant set of BFS
          Node nodeB = (Node) graphObject;

          //find label from result of BFS
          currentShortestDist = BFSResult.get(graphObject);

          //new distance between two nodes
          if(nodeB.isBreadthNode())
          {
            NodePair keyPair =
              new NodePair(entity, ((EntityAssociated) nodeB).getEntity(), currentShortestDist);

            //if shortest path is previously calculated
View Full Code Here
165
166
167
168
169
170
171
172
173
174
175
  {
    LinkedList<Node> tempNodeList = new LinkedList<Node>();

    for (Node node : nodes)
    {
      Node n = (Node) graph.getCorrespMember(node);
      assert n != null;
      tempNodeList.add(n);
    }
    nodes = tempNodeList;
View Full Code Here
TOP

Related Classes of org.patika.mada.graph.Node

  • org.gvt.action.AbstractLocalQueryAction
  • org.gvt.action.DebugButtonAction
  • org.gvt.action.GOIofSIFAction
  • org.gvt.action.HighlightWithRefAction
  • org.gvt.action.SearchCausativePathsAction
  • org.gvt.model.BioPAXGraph
  • org.gvt.model.biopaxl2.BioPAXGraph
  • org.gvt.model.biopaxl2.BioPAXL2Graph
  • org.gvt.model.biopaxl3.BioPAXL3Graph
  • org.patika.mada.algorithm.BFS
    • 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.