Package edu.uci.ics.jung.graph.impl

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

52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
    e.setUserDatum(JUConstants.LABEL, labelSet, UserData.SHARED);   
  }
 
  public static DirectedSparseGraph buildEVGraph(String graphString)
  {
    DirectedSparseGraph g = TestFSMAlgo.buildGraph(graphString, "simpleGraph");
    g.getEdgeConstraints().clear();
    List<Edge> newEdges = new LinkedList();
    for(DirectedSparseEdge e:(Set<DirectedSparseEdge>)g.getEdges())
    {
      Collection<String> labels = (Collection<String>)e.getUserDatum(JUConstants.LABEL);
      e.removeUserDatum(JUConstants.LABEL);
      Iterator<String> labelIt = labels.iterator();
      e.addUserDatum(EDGE, labelIt.next(), UserData.SHARED);
      while(labelIt.hasNext())
      {
        DirectedSparseEdge newEdge = new DirectedSparseEdge(e.getSource(),e.getDest());
        newEdge.setUserDatum(EDGE, labelIt.next(), UserData.SHARED);
        newEdges.add(newEdge);
      }
    }
   
    for(Edge e:newEdges)
      g.addEdge(e);
   
    for(DirectedSparseVertex v:(Set<DirectedSparseVertex>)g.getVertices())
    {
       v.addUserDatum(VERTEX, v.getUserDatum(JUConstants.LABEL), UserData.SHARED);
       v.removeUserDatum(JUConstants.LABEL);
    }
   
View Full Code Here
99
100
101
102
103
104
105
106
 
  @Test
  public final void testA()
  {
    String graphString = "S0-i0->S0-i1->S1\nS0-i3->S2\nS1-i0->S0\nS1-i1->S3\nS1-i2->S0";
    DirectedSparseGraph g=buildEVGraph(graphString);
    checkEquivalence(g,graphString);
  }
View Full Code Here
107
108
109
110
111
112
113
114
 
  @Test
  public final void testB()
  {
    String graphString = "A-a->B\nA-b->B-a->A-c->D";
    DirectedSparseGraph g=buildEVGraph(graphString);
    checkEquivalence(g,graphString);
  }
View Full Code Here
261
262
263
264
265
266
267
268
269
270
271
    report.write("\n[ Pairs merged (score-number of times):"
        + HistogramToSeries(whichScoresWereUsedForMerging, "MERGED"));
    report.write("\n[ Pairs restarted (score-number of times):"
        + HistogramToSeries(restartScoreDistribution, "RESTARTED"));
    report.write("\n Pair merge details: \n" + pairsMerged);
    DirectedSparseGraph result = scoreComputer.paths.getGraph(learntGraphName+"_result");
    result.addUserDatum(JUConstants.STATS, report.toString(),
        UserData.SHARED);
    updateGraph(scoreComputer);
    return result;
  }
View Full Code Here
74
75
76
77
78
79
80
81
82
83
84
    PTASequenceEngine sPlus = null, sMinus = null;int percent = 10;
    sPlus = rpg.getExtraSequences(percent/10-1);sMinus = rpg.getAllSequences(percent/10-1);

    int ptaSize = sMinus.numberOfLeafNodes();
    l.init(sMinus, ptaSize,ptaSize);// our imaginary positives are prefixes of negatives.
    DirectedSparseGraph learningOutcome = l.learnMachine();
    l.setQuestionCounter(0);
    LearnerGraph learned = new LearnerGraph(learningOutcome,config);
    PTA_computePrecisionRecall precRec = new PTA_computePrecisionRecall(learned);
    PTASequenceEngine engine = new PTA_FSMStructure(graph);
    precRec.crossWith(sMinus);
View Full Code Here
140
141
142
143
144
145
146
147
148
    report.write("\n[ Pair scores to iteration numbers:"+pairScoresAndIterations(scoresToIterations,"MERGED-ITERATIONS"));
    report.write("\n[ Restart scores to iteration numbers:"+pairScoresAndIterations(restartsToIterations,"RESTART-ITERATIONS"));
    report.write("\n[ Pairs merged (score-number of times):"+HistogramToSeries(whichScoresWereUsedForMerging,"MERGED"));
    report.write("\n[ Pairs restarted (score-number of times):"+HistogramToSeries(restartScoreDistribution,"RESTARTED"));
    report.write("\n Pair merge details: \n"+pairsMerged);
    DirectedSparseGraph result = scoreComputer.paths.getGraph();result.addUserDatum(JUConstants.STATS, report.toString(), UserData.SHARED);
    updateGraph(scoreComputer);
    return result;
  }
View Full Code Here
648
649
650
651
652
653
654
655
656
657
658
  }

  @Test
  public final void findMergeablePair3b()
  {
    DirectedSparseGraph g=FsmParser.buildLearnerGraphND("S-p->A-a->B\nA-b->B\nA-c->S\nA-b->S\nA-d->E", "findMergeablePair3b",config,getLabelConverter()).pathroutines.getGraph();
    Vertex
      b = DeterministicDirectedSparseGraph.findVertex(JUConstants.LABEL, VertexID.parseID("B"), g),
      s = DeterministicDirectedSparseGraph.findVertex(JUConstants.LABEL, VertexID.parseID("S"), g);
    OrigStatePair expected = new OrigStatePair(b,s),
    actualA = Test_Orig_RPNIBlueFringeLearner.findMergablePair(g);
View Full Code Here
660
661
662
663
664
665
666
667
668
  }

  @Test
  public final void findMergeablePair4()
  {
    DirectedSparseGraph g=FsmParser.buildLearnerGraphND("S-p->A-a->B\nA-b->B\nA-c-#D\nA-b-#D\nA-d->E", "findMergeablePair4",config,getLabelConverter()).pathroutines.getGraph();
    OrigStatePair actualA = Test_Orig_RPNIBlueFringeLearner.findMergablePair(g);
    Assert.assertNull(actualA);
  }
View Full Code Here
682
683
684
685
686
687
688
689
690
691
692
693
   * be false.
   */
  public void checkCorrectnessOfMerging(String machineToMerge, String expectedFSM,
      String stateBlue, String stateRed, String graphName, boolean checkWithEquals)
  {
    DirectedSparseGraph g=FsmParser.buildLearnerGraph(machineToMerge, graphName,config,getLabelConverter()).pathroutines.getGraph(),
      g2=(DirectedSparseGraph)g.copy();
    Vertex
      a = DeterministicDirectedSparseGraph.findVertex(JUConstants.LABEL, VertexID.parseID(stateRed), g),
      b = DeterministicDirectedSparseGraph.findVertex(JUConstants.LABEL, VertexID.parseID(stateBlue), g);
       
    Assert.assertNotNull("state "+stateRed+" was not found", a);
View Full Code Here
728
729
730
731
732
733
734
735
736
737
738
  }

  @Test
  public final void testMerge1a()
  {
    DirectedSparseGraph g=FsmParser.buildLearnerGraphND("S-p->A-a->S\nA-b->S\nA-c->D\nA-b->D\nA-d->E\nS-n->U", "testMerge1a",config,getLabelConverter()).pathroutines.getGraph();
    Vertex
      s = DeterministicDirectedSparseGraph.findVertex(JUConstants.LABEL, VertexID.parseID("S"), g),
      d = DeterministicDirectedSparseGraph.findVertex(JUConstants.LABEL, VertexID.parseID("U"), g);
    OrigStatePair pair = new OrigStatePair(d,s);
    LearnerGraph
View Full Code Here
TOP

Related Classes of edu.uci.ics.jung.graph.impl.DirectedSparseGraph

  • com.neptuny.xgrapher.cli.mapping.DefaultMapping
  • com.neptuny.xgrapher.cli.test.SimpleGraphDraw
  • net.gridshield.nexsm.graphmanager.GraphManager
  • org.cishell.algorithm.convertergraph.ConverterGraphComputation
  • org.cishell.reference.service.conversion.DataConversionServiceImpl
  • org.wymiwyg.knobot.visualization.TopicGraph
  • statechum.analysis.Erlang.Synapse$StatechumProcess
  • statechum.analysis.Erlang.TestSynapseAuxiliaryFunctions
  • statechum.analysis.learning.CheckComputeQuestions
  • statechum.analysis.learning.computeStateScores
    • 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.