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

Examples of edu.uci.ics.jung.graph.impl.DirectedSparseGraph.addUserDatum()

1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
                            {
                              Configuration config = Configuration.getDefaultConfiguration().copy();
                              LearnerGraphND machine = new LearnerGraphND(config);Synapse.StatechumProcess.parseStatemachine(message.elementAt(2),machine,null,true);
                              DirectedSparseGraph fsmPicture = machine.pathroutines.getGraph();
                              if (!fsmPicture.containsUserDatumKey(JUConstants.LAYOUTOPTIONS))
                                fsmPicture.addUserDatum(JUConstants.LAYOUTOPTIONS,new LayoutOptions(), UserData.SHARED);
                              int windowNumber = setOptions(message,3,fsmPicture);
                              if (windowNumber >= 0)
                                Visualiser.updateFrameWithPos(fsmPicture,windowNumber);

                              outcome = new OtpErlangTuple(new OtpErlangObject[]{ref,msgOk});
View Full Code Here
425
426
427
428
429
430
431
432
433
434
435
      }
     
      possibleMerges = topLearner.ChooseStatePairs(scoreComputer);
      //System.out.println(possibleMerges);
    }
    DirectedSparseGraph result = scoreComputer.paths.getGraph();result.addUserDatum(JUConstants.STATS, report.toString(), UserData.SHARED);
    if(config.getDebugMode())
      updateGraph(scoreComputer);
    return result;
  }
}
View Full Code Here
262
263
264
265
266
267
268
269
270
271
272
        + 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
140
141
142
143
144
145
146
147
148
149
    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
382
383
384
385
386
387
388
389
390
391
392
    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.getGraph();result.addUserDatum(JUConstants.STATS, report.toString(), UserData.SHARED);
    updateGraph(result);
    return result;
  }
/* 
  protected static void dumpSets(String output, Collection<List<String>> sPlus, Collection<List<String>> sMinus)
View Full Code Here
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
    Map<String,String> labelling = new TreeMap<String,String>();
    for(Entry<VertexID,VertexID> entry:oldVerticesToNew.entrySet())
      labelling.put(entry.getKey().toString(),entry.getValue().toString());
    DirectedSparseGraph gr = outcome.pathroutines.getGraph();
   
    gr.addUserDatum(JUConstants.VERTEX, labelling, UserData.SHARED);
    gr.addUserDatum(JUConstants.EDGE, transitionAnnotation, UserData.SHARED);
    return gr;
  }
} 
 
View Full Code Here
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
    for(Entry<VertexID,VertexID> entry:oldVerticesToNew.entrySet())
      labelling.put(entry.getKey().toString(),entry.getValue().toString());
    DirectedSparseGraph gr = outcome.pathroutines.getGraph();
   
    gr.addUserDatum(JUConstants.VERTEX, labelling, UserData.SHARED);
    gr.addUserDatum(JUConstants.EDGE, transitionAnnotation, UserData.SHARED);
    return gr;
  }
} 
 
View Full Code Here
958
959
960
961
962
963
964
965
966
967
968
        }
    }
   
    DirectedSparseGraph gr = result.pathroutines.getGraph();
   
    gr.addUserDatum(JUConstants.EDGE, transitionAnnotation, UserData.SHARED);
    return gr;
  }

  /** Returns a minimal version of this graph. */
  public LearnerGraph reduce()
View Full Code Here
285
286
287
288
289
290
291
292
293
294
295
      updateAnnotationsWithColour(outcome, added, transitionAnnotation, Color.GREEN);
      updateAnnotationsWithColour(outcome, removed, transitionAnnotation, Color.RED);
      DeterministicDirectedSparseGraph.findInitial(outcome).removeUserDatum(JUConstants.INITIAL);
      DeterministicDirectedSparseGraph.findVertexNamed(added.getInit(),outcome).addUserDatum(JUConstants.INITIAL, true, UserData.SHARED);
      Visualiser.LayoutOptions options = new Visualiser.LayoutOptions();options.showDIFF=true;
      outcome.addUserDatum(JUConstants.LAYOUTOPTIONS,options, UserData.SHARED);
      return outcome;
    }


  }
View Full Code Here
132
133
134
135
136
137
138
139
140
141
142
    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.getGraph();result.addUserDatum(JUConstants.STATS, report.toString(), UserData.SHARED);
    updateGraph(result);
    return result;
  }
 
  private Collection<List<String>> removeNegatives(Collection<List<String>> questions, computeStateScores temp){
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.