Package edu.uci.ics.jung.graph

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


    String serviceShortPID = serviceCompletePID.substring(startIndexForConverterName);
   
    /*
     * Build the actual edge & attach it to the graph.
     * */
    Edge edge = new DirectedSparseEdge(sourceNode, targetNode);
   
    edge.addUserDatum("converter_name", serviceShortPID,
        new UserDataContainer.CopyAction.Shared());
    edge.addUserDatum("service_pid", serviceCompletePID,
        new UserDataContainer.CopyAction.Shared());
   
    outputGraph.addEdge(edge);
  }
View Full Code Here


      Vertex targetVertex = (Vertex) dataTypeToVertex.get(targetDataType);
      String pid =
          (String) serviceReference.getProperty(Constants.SERVICE_PID);

      if (sourceVertex != null && targetVertex != null) {
        Edge edge = sourceVertex.findEdge(targetVertex);
        if (edge != null) {
          AbstractList serviceList =
              (AbstractList) edge.getUserDatum(SERVICE_LIST);
          for (Iterator refs = serviceList.iterator(); refs.hasNext();) {
            ServiceReference currentServiceReference =
                (ServiceReference) refs.next();
            String currentPid =
                (String) currentServiceReference
View Full Code Here

      Vertex targetVertex = getVertex(targetDataType);

      removeServiceReference(
          sourceDataType,  targetDataType, serviceReference);

      Edge directedEdge = sourceVertex.findEdge(targetVertex);
      if (directedEdge == null) {
        directedEdge =
            new DirectedSparseEdge(sourceVertex, targetVertex);
        graph.addEdge(directedEdge);
      }

      AbstractList serviceList =
          (AbstractList) directedEdge.getUserDatum(SERVICE_LIST);
      if (serviceList == null) {
        serviceList = new ArrayList();
        serviceList.add(serviceReference);
      }
      directedEdge.setUserDatum(SERVICE_LIST, serviceList,
          new UserDataContainer.CopyAction.Shared());
    }
  }
View Full Code Here

   */
  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")
        + File.separator
        + "convertGraph.xml");
View Full Code Here

            for (Object nv: _myGraph.getVertices()) {
                if (nv instanceof Vertex) {
                    ((Vertex)nv).removeUserDatum(userdatumkey + key);
                }
            }
            Edge e = null;
            NexsmEdgeType et = null;
            Boolean show = null;
           
            for (Object oe: _myGraph.getEdges()) {
                if (oe instanceof Edge) {
                    e = (Edge)oe;
                    if (e.getUserDatum("edgetype") != null) {
                        et = (NexsmEdgeType)e.getUserDatum("edgetype");
                        if (e.getUserDatum(userdatumkey + key) != null) {
                            show = (Boolean)e.getUserDatum(userdatumkey + key);
                            if (show != null &&
                                    et == NexsmEdgeType.Fictitious) {
                                e.removeUserDatum(userdatumkey + key);
                                _myGraph.removeEdge(e);
                            }
                        }
                    }
                }
View Full Code Here

                    if (v.getUserDatum(userdatumkey+key1) != null) {
                        v.setUserDatum(userdatumkey+key2, v.getUserDatum(userdatumkey+key1), UserData.REMOVE);
                    }
                }
            }
            Edge e = null;
            for (Object o: _myGraph.getEdges()) {
                if (o instanceof Edge) {
                    e = (Edge)o;
                    if (e.getUserDatum(userdatumkey+key1) != null) {
                        e.setUserDatum(userdatumkey+key2, e.getUserDatum(userdatumkey+key1), UserData.REMOVE);
                    }
                }
            }
            double dx, dy = 0;
            double scale = 0;
View Full Code Here

        Vertex vtmp = null;
        Set inE = v.getInEdges();
        Set outE = v.getOutEdges();
        Boolean hide = null;
        Object tmp = null;
        Edge e = null;
        NexsmEdgeType et = null;
        VisualizationViewer vv = getVV(key);
        VisualizationViewer vvSatellite = getVV(key + "satellite");
        //the childs
        for (Object o: outE) {
            if (o instanceof Edge) {
                e = (Edge)o;
                if (isVisible(e, key)) {
                    lchilds.add(e.getOpposite(v));
                }
            }
        }
       
        // the parents
        for (Object o: inE) {
            et = null;
            hide = null;
            if (o instanceof Edge) {
                e = (Edge)o;
                if (isVisible(e, key)) {
                    lparents.add(e.getOpposite(v));
                }
            }
        }
       
        e = null;
        for (Vertex p: lparents) {
            for (Vertex c: lchilds) {
                // as we are hiding the vertex, the new edges are not real for
                // these childs so the new edge is a false or fictitious edge
                if (!p.equals(c)) {
                    if ((e = p.findEdge(c)) == null) {
                        try {
                            e = addFalseEdge(p, c);
                        } catch (GraphException ge) {}
                    }
                    if (e != null)
                        e.setUserDatum(userdatumkey+key, new Boolean(hidden), UserData.CLONE);
                }
            }
        }
        v.setUserDatum(userdatumkey+key, new Boolean(hidden), UserData.CLONE);
        if (vv != null)
View Full Code Here

   
    public void setEdgeColor(String vertexname1, String vertexname2, String key, Color c) {
        Vertex v1 = getVertex(vertexname1);
        Vertex v2 = getVertex(vertexname2);
        if (v1 != null && v2 != null) {
            Edge e = v1.findEdge(v2);
            e.setUserDatum(userdatumkey + "color", c, UserData.CLONE);
        }
    }
View Full Code Here

     *@param v1 The first vertex
     *@param v2 The second vertex
     *@param key The name of the view we want to hide the edge
     */
    public void hideEdge(Vertex v1, Vertex v2, String key) {
        Edge e = v1.findEdge(v2);
        if (e!=null) {
            hideEdge(e, key);
        }
    }
View Full Code Here

    public Edge addEdge(Vertex parent, Vertex child) throws GraphException{
        return addEdge(parent, child, NexsmEdgeType.Real);
    }
   
    private Edge addEdge(Vertex parent, Vertex child, NexsmEdgeType et) throws GraphException {
        Edge e = null;
        try {
            if (_graphType == GraphTypes.Directed) {
                e = _myGraph.addEdge(new DirectedSparseEdge(parent, child));
            } else if (_graphType == GraphTypes.UnDirected)  {
                e = _myGraph.addEdge(new UndirectedSparseEdge(parent, child));
            }
            if (e != null)
                e.setUserDatum("edgetype", et, UserData.REMOVE);
        } catch (ConstraintViolationException cve) {
            throw new GraphException("Edge already existing between (" + parent.getUserDatum("name") + ") and (" + child.getUserDatum("name") + ")\n" +
                    "I'm thinking you have an error in nagios configuration regarding the parents entry of: (" + child.getUserDatum("name") +")");
        }
        return e;
View Full Code Here

TOP

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

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.