Examples of DirectedSparseGraph

edu.uci.ics.jung.graph.DirectedSparseGraph
An implementation of DirectedGraph suitable for sparse graphs.
edu.uci.ics.jung.graph.impl.DirectedSparseGraph

Examples of edu.uci.ics.jung.graph.impl.DirectedSparseGraph

    GD<List<CmpVertex>,List<CmpVertex>,LearnerGraphNDCachedData,LearnerGraphNDCachedData> gd = 
      new GD<List<CmpVertex>,List<CmpVertex>,LearnerGraphNDCachedData,LearnerGraphNDCachedData>();
    Configuration config = Configuration.getDefaultConfiguration();
    LearnerGraphND grA=new LearnerGraphND(buildGraph(graphA, "labellingDemo_A_"+counter),config),grB=
    new LearnerGraphND(buildGraph(graphB, "labellingDemo_B_"+counter),config);
    DirectedSparseGraph gr = gd.showGD(
        grA,grB,
        ExperimentRunner.getCpuNumber());
    if (display)
    {
    Visualiser.updateFrame(grA, grB);

View Full Code Here

Examples of edu.uci.ics.jung.graph.impl.DirectedSparseGraph

  }
  
  @Test
  public final void testGetData_Empty1()
  {
    DirectedSparseGraph g = new DirectedSparseGraph();
    DirectedSparseVertex init = new DirectedSparseVertex();
    init.addUserDatum(JUConstants.INITIAL, true, UserData.SHARED);
    init.addUserDatum(JUConstants.ACCEPTED, false, UserData.SHARED);
    init.addUserDatum(JUConstants.LABEL, "A", UserData.SHARED);
    g.addVertex(init);
    PTASequenceEngine engine = new PTA_FSMStructure(new LearnerGraph(g,config));
    vertifyPTA(engine, 1, new String[][] { 
        new String[] {}
      });
  }

View Full Code Here

Examples of edu.uci.ics.jung.graph.impl.DirectedSparseGraph

  }


  @Test
  public final void testGetData_Empty2()
  {
    DirectedSparseGraph g = new DirectedSparseGraph();
    DirectedSparseVertex init = new DirectedSparseVertex();
    init.addUserDatum(JUConstants.INITIAL, true,UserData.SHARED);
    init.addUserDatum(JUConstants.ACCEPTED, true, UserData.SHARED);
    init.addUserDatum(JUConstants.LABEL, "A", UserData.SHARED);
    g.addVertex(init);
    PTASequenceEngine engine = new PTA_FSMStructure(new LearnerGraph(g,config));
    vertifyPTA(engine, 1, new String[][] {
        new String[] {}
    });
  }

View Full Code Here

Examples of edu.uci.ics.jung.graph.impl.DirectedSparseGraph

   * only one state in the graph which is negative, the outcome is zero.
   */
  @Test
  public final void test_sequenceSet_testing_shouldBeReturned4()
  {
    DirectedSparseGraph g = new DirectedSparseGraph();
    DirectedSparseVertex init = new DirectedSparseVertex();
    init.addUserDatum(JUConstants.INITIAL, true, UserData.SHARED);
    init.addUserDatum(JUConstants.ACCEPTED, false, UserData.SHARED);
    init.addUserDatum(JUConstants.LABEL, "A", UserData.SHARED);
    g.addVertex(init);
    final LearnerGraph machine = new LearnerGraph(g,config);
    en = new PTA_FSMStructure(machine) {
      { 
        init(machine.new FSMImplementation(){
          @Override

View Full Code Here

Examples of edu.uci.ics.jung.graph.impl.DirectedSparseGraph


  /** Tests that we choke on an empty graph. */
  @Test(expected=IllegalArgumentException.class)
  public final void test_containsSequence1_fail()
  {
    DirectedSparseGraph g = new DirectedSparseGraph();
    DirectedSparseVertex init = new DirectedSparseVertex();
    init.addUserDatum(JUConstants.INITIAL, true, UserData.SHARED);
    init.addUserDatum(JUConstants.ACCEPTED, false, UserData.SHARED);
    init.addUserDatum(JUConstants.LABEL, "A", UserData.SHARED);
    g.addVertex(init);
    PTASequenceEngine engine = new PTA_FSMStructure(new LearnerGraph(g,config));
    engine.containsSequence(new ArrayList<String>());
  }

View Full Code Here

Examples of edu.uci.ics.jung.graph.impl.DirectedSparseGraph

  
  @Override
  public LearnerGraph learnMachine(Collection<List<String>> argSPlus, Collection<List<String>> argSMinus)   {
    this.sPlus = argSPlus;
    this.sMinus = argSMinus;
    DirectedSparseGraph model = createAugmentedPTA(sPlus, sMinus);// KIRR: node labelling is done by createAugmentedPTA 
    DeterministicDirectedSparseGraph.findInitial(model).setUserDatum(JUConstants.COLOUR, JUConstants.RED, UserData.SHARED);
    setChanged();


    Stack<OrigStatePair> possibleMerges = chooseStatePairs(model, sPlus, sMinus);
    while(!possibleMerges.isEmpty()){
      OrigStatePair pair = possibleMerges.pop();
      DirectedSparseGraph temp = mergeAndDeterminize(model, pair);
      pair.getQ().setUserDatum(JUConstants.HIGHLIGHT, pair, UserData.SHARED);
      pair.getR().setUserDatum(JUConstants.HIGHLIGHT, pair, UserData.SHARED);// since this copy of the graph will really not be used, changes to it are immaterial at this stage 
      setChanged();
      List<List<String>> questions = new ArrayList<List<String>>();
      doneEdges = new HashSet<DirectedSparseEdge>();

View Full Code Here

Examples of edu.uci.ics.jung.graph.impl.DirectedSparseGraph

    if(loopEdge!=null){
      Collection<String> looplabels = (Collection<String>)loopEdge.getUserDatum(JUConstants.LABEL);
      questions.addAll(mergePrefixWithSuffixes(prefixes, looplabels,suffixes));
    }
    
    DirectedSparseGraph questionPrefixes = augmentPTA(DeterministicDirectedSparseGraph.initialise(), questions, true);
    Iterator<Vertex> questionIt = getEndPoints(questionPrefixes).iterator();
    p = new DijkstraShortestPath(questionPrefixes);
    questions =new ArrayList<List<String>>();
    Vertex init = DeterministicDirectedSparseGraph.findInitial(questionPrefixes);
    while(questionIt.hasNext()){

View Full Code Here

Examples of edu.uci.ics.jung.graph.impl.DirectedSparseGraph

  public static DirectedSparseGraph mergeAndDeterminize(Graph model, OrigStatePair pair){
    Graph original = (Graph)model.copy();
    Vertex q = DeterministicDirectedSparseGraph.findVertex(JUConstants.LABEL, pair.getQ().getUserDatum(JUConstants.LABEL),original);
    Vertex qDash = DeterministicDirectedSparseGraph.findVertex(JUConstants.LABEL, pair.getR().getUserDatum(JUConstants.LABEL),original);
    
    DirectedSparseGraph temp = merge((DirectedSparseGraph)original, new OrigStatePair(q,qDash));
    OrigStatePair mergable = findMergablePair(temp);
    while(mergable!=null){
      temp=merge(temp, mergable);
      mergable = findMergablePair(temp);
    }

View Full Code Here

Examples of edu.uci.ics.jung.graph.impl.DirectedSparseGraph

    }
    return temp;
  }
  
  protected static DirectedSparseGraph createAugmentedPTA(Collection<List<String>> plus, Collection<List<String>> minus){
    DirectedSparseGraph model = DeterministicDirectedSparseGraph.initialise();
    model = augmentPTA(model, minus, false);
    model = augmentPTA(model, plus, true);
    DeterministicDirectedSparseGraph.numberVertices(model);
    return model;
  }

View Full Code Here

Examples of edu.uci.ics.jung.graph.impl.DirectedSparseGraph

  /** This one is a very old implementation of the learner, kept for some regression testing 
   * but not participating in the logging-and-comparing type of testing.
   */ 
  @Override 
  public LearnerGraph learnMachine(@SuppressWarnings("unused") Collection<List<String>> plus, @SuppressWarnings("unused") Collection<List<String>> minus) {
    DirectedSparseGraph model = init(sPlus, sMinus).pathroutines.getGraph();
    
    Vertex init = DeterministicDirectedSparseGraph.findInitial(model);
    init.setUserDatum(JUConstants.COLOUR, JUConstants.RED, UserData.SHARED);


    Stack<OrigStatePair> possibleMerges = chooseStatePairs(model, sPlus, sMinus);
    while(!possibleMerges.isEmpty()){
      OrigStatePair pair = possibleMerges.pop();


      DirectedSparseGraph temp = mergeAndDeterminize((Graph)model.copy(), pair);
      if(compatible(temp, sPlus, sMinus)){// KIRR: this should always return true
        pair.getQ().setUserDatum(JUConstants.HIGHLIGHT, pair, UserData.SHARED);
        pair.getR().setUserDatum(JUConstants.HIGHLIGHT, pair, UserData.SHARED);
        setChanged();
        List<List<String>> questions;

View Full Code Here

0 1 2 3 4 5

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.