Examples of edu.uci.ics.jung.graph.Graph.addEdge()

edu.uci.ics.jung.graph.Graph.addEdge()
Adds edge e to this graph such that it connects vertex v1 to v2. Equivalent to addEdge(e, new Pair(v1, v2)). If this graph does not contain v1, v2, or both, implementations may choose to either silently add the vertices to the graph or throw an IllegalArgumentException. If this graph assigns edge types to its edges, the edge type of e will be the default for this graph. See Hypergraph.addEdge() for a listing of possible reasons for failure. @param e the edge to be added @param v1 the first vertex to be connected @param v2 the second vertex to be connected @return true if the add is successful, false otherwise @see Hypergraph#addEdge(Object,Collection) @see #addEdge(Object,Object,Object,EdgeType)

                        if(clusterGraph.equals(v1)) {
                            // i need a new v1
                            Object originalV1 = originalGraph.getEndpoints(edge).getFirst();
                            Object newV1 = findVertex(graph, originalV1);
                            assert newV1 != null : "newV1 for "+originalV1+" was not found!";
                            graph.addEdge(edge, newV1, v2, inGraph.getEdgeType(edge));
                        } else if(clusterGraph.equals(v2)) {
                            // i need a new v2
                            Object originalV2 = originalGraph.getEndpoints(edge).getSecond();
                            Object newV2 = findVertex(graph, originalV2);
                            assert newV2 != null : "newV2 for "+originalV2+" was not found!";

View Full Code Here

                        } else if(clusterGraph.equals(v2)) {
                            // i need a new v2
                            Object originalV2 = originalGraph.getEndpoints(edge).getSecond();
                            Object newV2 = findVertex(graph, originalV2);
                            assert newV2 != null : "newV2 for "+originalV2+" was not found!";
                            graph.addEdge(edge, v1, newV2, inGraph.getEdgeType(edge));
                        } else {
                          graph.addEdge(edge, v1, v2, inGraph.getEdgeType(edge));
                        }
                    }
                }

View Full Code Here

                            Object originalV2 = originalGraph.getEndpoints(edge).getSecond();
                            Object newV2 = findVertex(graph, originalV2);
                            assert newV2 != null : "newV2 for "+originalV2+" was not found!";
                            graph.addEdge(edge, v1, newV2, inGraph.getEdgeType(edge));
                        } else {
                          graph.addEdge(edge, v1, v2, inGraph.getEdgeType(edge));
                        }
                    }
                }
            }
        }

View Full Code Here

            for(Object edge : edges) {
                Pair endpoints = inGraph.getEndpoints(edge);
                Object v1 = endpoints.getFirst();
                Object v2 = endpoints.getSecond();
                if(picked.containsAll(endpoints)) {
                    clusterGraph.addEdge(edge, v1, v2, inGraph.getEdgeType(edge));
                }
            }
        }
        return clusterGraph;
    }

View Full Code Here

0 1

TOP

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.