List of containsNode() Examples

Examples of containsNode()

diva.graph.GraphModel.containsNode()
Return true if this graph or composite node contains the given node.
lt.refactory.primsAlgo.graph.WeightedEdge.containsNode()
org.aisearch.data.Path.containsNode()
org.openstreetmap.josm.data.osm.Way.containsNode()
Replies true if this way contains the node node, false otherwise. Replies false if node is null. @param node the node. May be null. @return true if this way contains the node node, falseotherwise @since 1911
ptolemy.graph.Graph.containsNode()
Return True if the specified node exists in the graph. @param node The specified node. @return True if the specified node exists in thegraph.
soot.toolkits.graph.HashMutableDirectedGraph.containsNode()
soot.toolkits.graph.HashMutableEdgeLabelledDirectedGraph.containsNode()
soot.toolkits.graph.MutableEdgeLabelledDirectedGraph.containsNode()

Examples of diva.graph.GraphModel.containsNode()

    // figure out which of their parents IS in the graph and calculate the
    // cost of that instead.
    private Object _getParentInGraph(Object node) {
        GraphModel model = getLayoutTarget().getGraphModel();


        while ((node != null) && !model.containsNode(_graph, node)) {
            Object parent = model.getParent(node);


            if (model.isNode(parent)) {
                node = parent;
            } else {

View Full Code Here

Examples of lt.refactory.primsAlgo.graph.WeightedEdge.containsNode()

    
    LinearFunctionParameters linearParameters = SteinersAlgorithm.getLinearFunctionParameters(edge.getStart(), edge.getEnd());


    // find node which does not belong to edge - another node will have one
    Node oppositeSideNode;
    if (edge.containsNode(triangle.getEdgeList().get(1).getStart())) {
      oppositeSideNode = triangle.getEdgeList().get(1).getEnd();
    } else {
      oppositeSideNode = triangle.getEdgeList().get(1).getStart();
    }

View Full Code Here

Examples of org.aisearch.data.Path.containsNode()

      INode currentNode = bestPath.getLastEdge().getTargetNode();
      if (goalTest.isGoal(currentNode))
        return bestPath;
      List<Path> newPaths = new ArrayList<Path>();
      for (Edge edge : currentNode.generateSuccessors()) {
        if (bestPath.containsNode(edge.getTargetNode()))
          continue;
        newPaths.add(new Path(bestPath, edge));
      }
      queueInserter.insert(queue, newPaths);
    }

View Full Code Here

Examples of org.openstreetmap.josm.data.osm.Way.containsNode()

        Way w = (Way)hull.getPrimitiveById(30,OsmPrimitiveType.WAY);
        assertNotNull(w);
        assertEquals(2, w.getNodesCount());
        Node n = (Node)hull.getPrimitiveById(21, OsmPrimitiveType.NODE);
        assertNotNull(n);
        assertTrue(w.containsNode(n));


        n = (Node)hull.getPrimitiveById(22,OsmPrimitiveType.NODE);
        assertNotNull(n);
        assertTrue(w.containsNode(n));

View Full Code Here

Examples of org.openstreetmap.josm.data.osm.Way.containsNode()

        assertNotNull(n);
        assertTrue(w.containsNode(n));


        n = (Node)hull.getPrimitiveById(22,OsmPrimitiveType.NODE);
        assertNotNull(n);
        assertTrue(w.containsNode(n));


        Relation r = (Relation)hull.getPrimitiveById(40,OsmPrimitiveType.RELATION);
        assertNotNull(r);


        r = (Relation)hull.getPrimitiveById(1, OsmPrimitiveType.RELATION);

View Full Code Here

Examples of org.openstreetmap.josm.data.osm.Way.containsNode()

        assertNotNull(w);
        assertEquals(2, w.getNodesCount());


        Node n = (Node)lookupByName(hull.getNodes(), "n21");
        assertNotNull(n);
        assertTrue(w.containsNode(n));


        n = (Node)lookupByName(hull.getNodes(), "n22");
        assertNotNull(n);
        assertTrue(w.containsNode(n));

View Full Code Here

Examples of org.openstreetmap.josm.data.osm.Way.containsNode()

        assertNotNull(n);
        assertTrue(w.containsNode(n));


        n = (Node)lookupByName(hull.getNodes(), "n22");
        assertNotNull(n);
        assertTrue(w.containsNode(n));


        Relation r = (Relation)lookupByName(hull.getRelations(), "r40");
        assertNotNull(r);


        r = (Relation)lookupByName(hull.getRelations(), "r1");

View Full Code Here

Examples of ptolemy.graph.Graph.containsNode()


                while (inPorts.hasNext()) {
                    IOPort inPort = (IOPort) (inPorts.next());
                    Actor sink = (Actor) (inPort.getContainer());


                    if (graph.containsNode((Node) (_actorMap.get(sink)))) {
                        if (_debug) {
                            System.out.println("Adding edge from " + source
                                    + " to " + sink);
                        }

View Full Code Here

Examples of soot.toolkits.graph.HashMutableDirectedGraph.containsNode()

          {
            // add these orderings to tn's visible order
            MutableDirectedGraph orderings = lockOrder.getEdgesForLabel(otherTn);
            for(Object node1 : orderings.getNodes())
            {
              if(!visibleOrder.containsNode(node1))
                visibleOrder.addNode(node1);
              for(Object node2 : orderings.getSuccsOf(node1))
              {
                if(!visibleOrder.containsNode(node2))
                  visibleOrder.addNode(node2);

View Full Code Here

Examples of soot.toolkits.graph.HashMutableDirectedGraph.containsNode()

            {
              if(!visibleOrder.containsNode(node1))
                visibleOrder.addNode(node1);
              for(Object node2 : orderings.getSuccsOf(node1))
              {
                if(!visibleOrder.containsNode(node2))
                  visibleOrder.addNode(node2);
                visibleOrder.addEdge(node1, node2);
              }
            }
          }

View Full Code Here

0 1

TOP

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.