Examples of pathExists()

Examples of Hack.Utilities.Graph.pathExists()

96
97
98
99
100
101
102
103
104
105
106
        // for each input pin, check if there is a path in the graph to an output pin
        // (actually to the "master output", which all outputs connect to).
        // If there is, the input is not clocked. Otherwise, it is.
        for (int i = 0; i < inputPinsInfo.length; i++)
            isInputClocked[i] = !graph.pathExists(inputPinsInfo[i], outputPinsInfo);

        // for each output pin, check if there is a path in the graph from any input pin
        // (actually from the "master input", which connects to all inputs) to this output pin.
        // If there is, the output is not clocked. Otherwise, it is.
        for (int i = 0; i < outputPinsInfo.length; i++)
View Full Code Here

Examples of Hack.Utilities.Graph.pathExists()

102
103
104
105
106
107
108
109
110
111
112
        // for each output pin, check if there is a path in the graph from any input pin
        // (actually from the "master input", which connects to all inputs) to this output pin.
        // If there is, the output is not clocked. Otherwise, it is.
        for (int i = 0; i < outputPinsInfo.length; i++)
            isOutputClocked[i] = !graph.pathExists(inputPinsInfo, outputPinsInfo[i]);
    }

    // Reads the parts list from the given HDL input
    private void readParts(HDLTokenizer input)
     throws HDLException {
View Full Code Here

Examples of cascading.lingual.platform.PlatformBroker.pathExists()

49
50
51
52
53
54
55
56
57
58
59
    PlatformBroker broker = PlatformBrokerFactory.createPlatformBroker( getPlatformName(), properties );

    String catalogFilePath = PlatformBroker.buildPath( "/", brokerDataPath, "_lingual", "catalog.json" );

    if( broker.pathExists( catalogFilePath ) )
      broker.deletePath( catalogFilePath );

    assertFalse( "catalog loaded", broker.catalogManagerLoaded() );

    SchemaCatalogManager catalog = broker.getCatalogManager();
View Full Code Here

Examples of org._3pq.jgrapht.alg.ConnectivityInspector.pathExists()

90
91
92
93
94
95
96
97
98
  //xxx Insanely inefficient stub
  public boolean isConnected (Variable v1, Variable v2)
  {
    UndirectedGraph g = Graphs.mdlToGraph (this);
    ConnectivityInspector ins = new ConnectivityInspector (g);
    return g.containsVertex (v1) && g.containsVertex (v2) && ins.pathExists (v1, v2);
  }

}
View Full Code Here

Examples of org._3pq.jgrapht.alg.ConnectivityInspector.pathExists()

67
68
69
70
71
72
73
74
75
76
77
  private void checkForNoCycle (VarSet parents, Variable child, CPT cpt) {
    ConnectivityInspector inspector = new ConnectivityInspector (graph);
    for (Iterator it = parents.iterator (); it.hasNext ();) {
      Variable rent = (Variable) it.next ();
      if (inspector.pathExists (child, rent)) {
        throw new IllegalArgumentException ("Error adding CPT: Would create directed cycle"+
                        "From: "+rent+" To:"+child+"\nCPT: "+cpt);
      }
    }
  }
View Full Code Here

Examples of org._3pq.jgrapht.alg.ConnectivityInspector.pathExists()

360
361
362
363
364
365
366
367
368
369
370
    int edgesAdded = 0;
    while (edgesAdded < numCliques - 1) {
      VarSet[] pair = (VarSet[]) pq.first();
      pq.remove(pair);

      if (!inspector.pathExists(pair[0], pair[1])) {
          g.addEdge(pair[0], pair[1]);
          edgesAdded++;
      }
    }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.