Examples of nz.ac.waikato.jdsl.graph.ref.IncidenceListGraph$ILEdgeDummy

nz.ac.waikato.jdsl.graph.ref.IncidenceListGraph
Dummy node in each vertex's list of edges, so the vertex and the real edges always have something to point to (avoids special-casing on ends of edge list and on detached vertices). The interesting methods take vertices (ignored by the dummy) because real edges have two endpoints, so they need to know which endpoint's list is being talked about.

   *  That is, a reset has just been done.
   */
  protected void startBuildGraph()
  {
    assert fsmState != null;
    fsmGraph = new IncidenceListGraph();
    fsmVertex = new HashMap<Object,Vertex>();
    fsmDone = new HashMap<Object,BitSet>();
    fsmTodo = new HashMap<Object,BitSet>();
    // set up the initial state
    Vertex initial = fsmGraph.insertVertex(fsmState);

View Full Code Here

  {
    super.setModel(model);
    clearDoneTodo();
    Object curr = model_.getCurrentState(); //the initial state
    // set up the initial state
    fsmGraph_ = new IncidenceListGraph();
    fsmVertex_ = new HashMap<Object,Vertex>();
    Vertex initial = fsmGraph_.insertVertex(curr);
    assert initial != null;
    printProgress(3, "buildgraph: start with vertex for initial state "+curr);
    fsmVertex_.put(curr, initial);

View Full Code Here

TOP

Related Classes of nz.ac.waikato.jdsl.graph.ref.IncidenceListGraph$ILEdgeDummy

nz.ac.waikato.jdsl.core.ref.NodeSequence

nz.ac.waikato.modeljunit.GraphListener

nz.ac.waikato.modeljunit.ModelTestCase

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.