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

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

67
68
69
70
71
72
73
74
75
76
77
      LogService logger) {
   
    this.nodeCount = 0;
    this.logger = logger;
    this.allConverterServices = allConverterServices;
    this.outputGraph = new DirectedSparseGraph();
   
    /*
     * Side affects nodes & edges
     * */
    processServiceReferences();
 
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
   */
  public DataConversionServiceImpl(BundleContext bContext, CIShellContext ciContext) {
    this.bContext = bContext;
    this.ciContext = ciContext;

    this.graph = new DirectedSparseGraph();
    this.dataTypeToVertex = new HashMap<String,Vertex>();

    String filter = "(&("+ALGORITHM_TYPE+"="+TYPE_CONVERTER+")" +
        "("+IN_DATA+"=*) " +
        "("+OUT_DATA+"=*)" +
View Full Code Here
309
310
311
312
313
314
315
316
317
318
319
       
        _graphType = type;
       
        _rndDecorator = new RandomVertexLocationDecorator(new Dimension(1000,1000));
        if (_graphType == GraphTypes.Directed) {
            _myGraph = new DirectedSparseGraph();
        } else if (_graphType == GraphTypes.UnDirected){
            _myGraph = new UndirectedSparseGraph();
        } else {
            throw new GraphException("Error in GraphManager, the specified graph type is not either Directed or UnDirected");
        }
View Full Code Here
707
708
709
710
711
712
713
714
715
716
717
718
719
720
    return v.containsUserDatumKey(JUConstants.INITIAL);   
  }

  /** Creates a graph with a single accept-vertex. */
  public static DirectedSparseGraph initialise(){
    DirectedSparseGraph pta = new DirectedSparseGraph();
    DirectedSparseVertex init = new DirectedSparseVertex();
    init.addUserDatum(JUConstants.INITIAL, true, UserData.SHARED);
    init.addUserDatum(JUConstants.ACCEPTED, true, UserData.SHARED);
    pta.setUserDatum(JUConstants.TITLE, "Hypothesis machine", UserData.SHARED);
    pta.addVertex(init);
    DeterministicDirectedSparseGraph.numberVertices(pta);
    return pta;
  }
View Full Code Here
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
   * This one only copies vertices which participate in transitions.
   */
  @SuppressWarnings("unchecked")
  public static DirectedSparseGraph copy(Graph g)
  {
    DirectedSparseGraph result = new DirectedSparseGraph();
    Map<VertexID,DeterministicVertex> newVertices = new TreeMap<VertexID,DeterministicVertex>();
    for(DirectedSparseEdge e:(Set<DirectedSparseEdge>)g.getEdges())
    {
      DeterministicVertex newSrc = DeterministicDirectedSparseGraph.copyVertex(newVertices,result,e.getSource()),
        newDst = DeterministicDirectedSparseGraph.copyVertex(newVertices, result, e.getDest());
      DirectedSparseEdge newEdge = new DirectedSparseEdge(newSrc,newDst);
      newEdge.addUserDatum(JUConstants.LABEL, ((HashSet<String>)e.getUserDatum(JUConstants.LABEL)).clone(), UserData.SHARED);
      result.addEdge(newEdge);
    }
    return result;
  }
View Full Code Here
555
556
557
558
559
560
561
562
563
564
565
566
567
568
    return v.containsUserDatumKey(JUConstants.INITIAL);   
  }

  /** Creates a graph with a single accept-vertex. */
  public static DirectedSparseGraph initialise(){
    DirectedSparseGraph pta = new DirectedSparseGraph();
    DirectedSparseVertex init = new DirectedSparseVertex();
    init.addUserDatum(JUConstants.INITIAL, true, UserData.SHARED);
    init.addUserDatum(JUConstants.ACCEPTED, true, UserData.SHARED);
    pta.setUserDatum(JUConstants.TITLE, "Hypothesis machine", UserData.SHARED);
    pta.addVertex(init);
    DeterministicDirectedSparseGraph.numberVertices(pta);
    return pta;
  }
View Full Code Here
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
   * This one only copies vertices which participate in transitions.
   */
  @SuppressWarnings("unchecked")
  public static DirectedSparseGraph copy(Graph g)
  {
    DirectedSparseGraph result = new DirectedSparseGraph();
    Map<VertexID,DeterministicVertex> newVertices = new TreeMap<VertexID,DeterministicVertex>();
    for(DirectedSparseEdge e:(Set<DirectedSparseEdge>)g.getEdges())
    {
      DeterministicVertex newSrc = DeterministicDirectedSparseGraph.copyVertex(newVertices,result,e.getSource()),
        newDst = DeterministicDirectedSparseGraph.copyVertex(newVertices, result, e.getDest());
      DirectedSparseEdge newEdge = new DirectedSparseEdge(newSrc,newDst);
      newEdge.addUserDatum(JUConstants.LABEL, ((HashSet<String>)e.getUserDatum(JUConstants.LABEL)).clone(), UserData.SHARED);
      result.addEdge(newEdge);
    }
    return result;
  }
View Full Code Here
43
44
45
46
47
48
49
50
51
  /**
   * @param hypothesis followed by actual graph
   */
  public static void main(String[] args) {
    DirectedSparseGraph specGraph = FsmParser.buildGraph("q0-initialise->q1-connect->q2-login->q3-setfiletype->q4-rename->q6-storefile->q5-setfiletype->q4-storefile->q7-appendfile->q5-setfiletype->q4\nq3-makedir->q8-makedir->q8-logout->q16-disconnect->q17\nq3-changedir->q9-listnames->q10-delete->q10-changedir->q9\nq10-appendfile->q11-logout->q16\nq3-storefile->q11\nq3-listfiles->q13-retrievefile->q13-logout->q16\nq13-changedir->q14-listfiles->q13\nq7-logout->q16\nq6-logout->q16", "specgraph");
    DirectedSparseGraph impGraph = FsmParser.buildGraph("q0-initialise->q1-connect->q2-login->q3-storefile->q9-logout->q12-disconnect->q13\nq3-makedir->q8-makedir->q8-logout->q12\nq3-setfiletype->q4-storefile->q5-appendfile->q6-setfiletype->q4-rename->q7-storefile->q6\nq7-logout->q12\nq3-listfiles->q11-retrievefile->q11-changedirectory->q10-listfiles->q11-logout->q12\nq3-changedirectory->q17-listnames->q16-changedirectory->q17\nq16-delete->q14-delete->q15-delete->q16\nq14-changedirectory->q13\nq14-appendfile->q7", "impGraph");
    compare(specGraph, impGraph);
  }
View Full Code Here
49
50
51
52
53
54
55
56
    DirectedSparseGraph impGraph = FsmParser.buildGraph("q0-initialise->q1-connect->q2-login->q3-storefile->q9-logout->q12-disconnect->q13\nq3-makedir->q8-makedir->q8-logout->q12\nq3-setfiletype->q4-storefile->q5-appendfile->q6-setfiletype->q4-rename->q7-storefile->q6\nq7-logout->q12\nq3-listfiles->q11-retrievefile->q11-changedirectory->q10-listfiles->q11-logout->q12\nq3-changedirectory->q17-listnames->q16-changedirectory->q17\nq16-delete->q14-delete->q15-delete->q16\nq14-changedirectory->q13\nq14-appendfile->q7", "impGraph");
    compare(specGraph, impGraph);
  }
 
  public static void compare(String spec, DirectedSparseGraph imp){
    DirectedSparseGraph specGraph = FsmParser.buildGraph(spec, "specGraph");
    compare(specGraph, imp);
  }
View Full Code Here
44
45
46
47
48
49
50
51
52
53
54
    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
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.