Examples of edu.uci.ics.jung.graph.Graph

edu.uci.ics.jung.graph.Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E. Edges of this graph type have exactly two endpoints; whether these endpoints must be distinct depends on the implementation.
This interface permits, but does not enforce, any of the following common variations of graphs:
- directed and undirected edges
- vertices and edges with attributes (for example, weighted edges)
- vertices and edges of different types (for example, bipartite or multimodal graphs)
- parallel edges (multiple edges which connect a single set of vertices)
- representations as matrices or as adjacency lists or adjacency maps
Extensions or implementations of this interface may enforce or disallow any or all of these variations.
Definitions (with respect to a given vertex v):
- incoming edge of v: an edge that can be traversed from a neighbor of v to reach v
- outgoing edge of v: an edge that can be traversed from v to reach some neighbor of v
- predecessor of v: a vertex at the other end of an incoming edge of v
- successor of v: a vertex at the other end of an outgoing edge of v
@author Joshua O'Madadhain

   * Save the current converter graph to the user's home directory


   */
  private void saveGraph() {
    GraphMLFile writer = new GraphMLFile();
    Graph g = (Graph) graph.copy();
    for (Iterator edges = g.getEdges().iterator(); edges.hasNext();) {
      Edge e = (Edge) edges.next();
      e.removeUserDatum(SERVICE_LIST);
    }


    writer.save(g, System.getProperty("user.home")

View Full Code Here

     */
    public void mousePressed(MouseEvent e) {
        Point p = e.getPoint();
        if (checkModifiers(e) || e.getModifiers() == mskbutton) {
            final VisualizationViewer vv = (VisualizationViewer)e.getSource();
            final Graph graph = vv.getGraphLayout().getGraph();
            //todo remove
            JPopupMenu jpm = new JPopupMenu();
            if (isInVV == false) {
                
                info.setVisible(false);

View Full Code Here

     */
    public void mousePressed(MouseEvent e) {
        Point p = e.getPoint();
        if (checkModifiers(e) || e.getModifiers() == mskbutton) {
            final VisualizationViewer vv = (VisualizationViewer)e.getSource();
            final Graph graph = vv.getGraphLayout().getGraph();
            Point2D ip = vv.inverseViewTransform(p);


            PickSupport picksupport = vv.getPickSupport();
            final PickedState pickedstate = vv.getPickedState();
            Vertex v = picksupport.getVertex(ip.getX(), ip.getY());

View Full Code Here

    }
  }  
  
  /** Makes a copy of the graph given to it and merges states in the pair supplied. */
  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);

View Full Code Here

    }
  }  
  
  /** Makes a copy of the graph given to it and merges states in the pair supplied. */
  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);
    pair = new OrigStatePair(q,qDash);
    DirectedSparseGraph temp = merge((DirectedSparseGraph)original, pair);
    OrigStatePair mergable = findMergablePair(temp);

View Full Code Here

    StringWriter writer = new StringWriter();gr.transform322.writeGraphML(writer);
    synchronized (LearnerGraph.syncObj) 
    {// ensure that the calls to Jung's vertex-creation routines do not occur on different threads.
        GraphMLFile graphmlFile = new GraphMLFile();
        graphmlFile.setGraphMLFileHandler(new ExperimentGraphMLHandler());
        Graph brokenGraph=graphmlFile.load(new StringReader(writer.toString().replace("VERTEX=\"BB1\"", "VERTEX=\""+Transform322.Initial+" BB1\"")));
        try
        {
          new LearnerGraph(brokenGraph,Configuration.getDefaultConfiguration());
        }
        catch(IllegalArgumentException ex)

View Full Code Here

    StringWriter writer = new StringWriter();gr.transform322.writeGraphML(writer);
    synchronized (computeStateScores.syncObj) 
    {// ensure that the calls to Jung's vertex-creation routines do not occur on different threads.
        GraphMLFile graphmlFile = new GraphMLFile();
        graphmlFile.setGraphMLFileHandler(new ExperimentGraphMLHandler());
        Graph brokenGraph=graphmlFile.load(new StringReader(writer.toString().replace("VERTEX=\"BB1\"", "VERTEX=\""+Transform322.Initial+" BB1\"")));
        try
        {
          new FSMStructure(brokenGraph,Configuration.getDefaultConfiguration());
        }
        catch(IllegalArgumentException ex)

View Full Code Here

    StringWriter writer = new StringWriter();gr.transform.writeGraphML(writer);
    synchronized (LearnerGraph.syncObj) 
    {// ensure that the calls to Jung's vertex-creation routines do not occur on different threads.
        GraphMLFile graphmlFile = new GraphMLFile();
        graphmlFile.setGraphMLFileHandler(new ExperimentGraphMLHandler());
        Graph g=graphmlFile.load(new StringReader(writer.toString().replace("BB1", Transform.Initial+"_BB1")));
        try
        {
          new LearnerGraph(g,Configuration.getDefaultConfiguration());
        }
        catch(IllegalArgumentException ex)

View Full Code Here

    }
  }  
  
  /** Makes a copy of the graph given to it and merges states in the pair supplied. */
  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);
    pair = new OrigStatePair(q,qDash);
    DirectedSparseGraph temp = merge((DirectedSparseGraph)original, pair);
    OrigStatePair mergable = findMergablePair(temp);

View Full Code Here

    }
  }  
  
  /** Makes a copy of the graph given to it and merges states in the pair supplied. */
  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);

View Full Code Here

0 1 2

TOP

Related Classes of edu.uci.ics.jung.graph.Graph

com.neptuny.xgrapher.cli.test.SimpleGraphDraw

edu.uci.ics.jung.samples.SimpleGraphDraw

edu.uci.ics.jung.samples.VertexCollapseDemo

edu.uci.ics.jung.samples.VertexCollapseDemoWithLayouts

edu.uci.ics.jung.visualization.subLayout.GraphCollapser

net.gridshield.nexsm.graphmanager.NexsmInfoGraphMousePlugin

net.gridshield.nexsm.graphmanager.NexsmInfoGraphMousePlugin_1

org.cishell.reference.service.conversion.DataConversionServiceImpl

org.wymiwyg.knobot.visualization.TopicGraph

project.gluebooster.graph.jung.TestJungGraphBoostUtils

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.