List of addEdge() Examples

Examples of addEdge()

Hack.Utilities.Graph.addEdge()
Adds an edge between the source and target objects. If the source or target objects don't exist yet in the graph, they will be added automatically. If the edge aleardy exists, nothing will happen.
bgu.bio.adt.graphs.FlexibleGraph.addEdge()
Add an edge to graph @param from the source of the edge @param to the target of the edge
bgu.bio.adt.graphs.FlexibleUndirectedGraph.addEdge()
Add an edge between two nodes @param u first node @param v second node
ch.ethz.inf.se.rcl.examples.delaunayrefinement.graph.Node.addEdge()
ch.ethz.inf.se.soj.examples.delaunayrefinement.graph.Node.addEdge()
com.crawljax.core.state.StateFlowGraph.addEdge()
Adds the specified edge to this graph, going from the source vertex to the target vertex. More formally, adds the specified edge, e, to this graph if this graph contains no edge e2 such that e2.equals(e). If this graph already contains such an edge, the call leaves this graph unchanged and returns false. Some graphs do not allow edge-multiplicity. In such cases, if the graph already contains an edge from the specified source to the specified target, than this method does not change the graph and returns false. If the edge was added to the graph, returns true. The source and target vertices must already be contained in this graph. If they are not found in graph IllegalArgumentException is thrown. @param sourceVert source vertex of the edge. @param targetVert target vertex of the edge. @param clickable the clickable edge to be added to this graph. @return true if this graph did not already contain the specified edge. @see org.jgrapht.Graph#addEdge(Object,Object,Object)
com.dianping.cat.report.page.dependency.dashboard.ProductLinesDashboard.addEdge()
com.evelopers.unimod.glayout.graph.SimpleGraph.addEdge()
Add new edge to graph @param se edge to add
com.evelopers.unimod.glayout.graph.containers.Chain.addEdge()
com.evelopers.unimod.glayout.graph.containers.Face.addEdge()
com.evelopers.unimod.glayout.graph.containers.Path.addEdge()
com.evelopers.unimod.glayout.graph.containers.Segment.addEdge()
com.founder.fix.fixflow.core.impl.flowgraphics.svg.SvgBench.addEdge()
com.google.devtools.depan.model.GraphModel.addEdge()
com.google.devtools.depan.model.interfaces.GraphBuilder.addEdge()
Add the given Edge to the list of edges in the graph. @param edge new Edge. @return the newly inserted Edge.
com.intel.hadoop.graphbuilder.graph.simplegraph.SimpleGraph.addEdge()
com.pcbje.maltegoimporter.model.GraphModel.addEdge()
Add an edge to the graph. @param edge The edge to add.
com.pcbje.maltegoimporter.model.impl.MaltegoGraphModel.addEdge()
{@inheritDoc}
com.puppetlabs.graph.elements.RootGraph.addEdge()
com.sun.hotspot.igv.data.InputGraph.addEdge()
com.thinkaurelius.faunus.FaunusVertex.addEdge()
com.thinkaurelius.titan.core.TitanGraph.addEdge()
com.thinkaurelius.titan.core.TitanVertex.addEdge()
Creates a new edge incident on this vertex.
Creates and returns a new {@link TitanEdge} of the specified label with this vertex being the outgoing vertexand the given vertex being the incoming vertex. @param label label of the edge to be created @param vertex incoming vertex of the edge to be created @return new edge
com.tinkerpop.blueprints.Graph.addEdge()
Add an edge to the graph. The added edges requires a recommended identifier, a tail vertex, an head vertex, and a label. Like adding a vertex, the provided object identifier may be ignored by the implementation. @param id the recommended object identifier @param outVertex the vertex on the tail of the edge @param inVertex the vertex on the head of the edge @param label the label associated with the edge @return the newly created edge
com.tinkerpop.blueprints.KeyIndexableGraph.addEdge()
com.tinkerpop.blueprints.Vertex.addEdge()
Add a new outgoing edge from this vertex to the parameter vertex with provided edge label. @param label the label of the edge @param inVertex the vertex to connect to with an incoming edge @return the newly created edge
com.tinkerpop.blueprints.impls.orient.OrientBaseGraph.addEdge()
Creates an edge between a source Vertex and a destination Vertex setting label as Edge's label. @param id Optional, can contains the Edge's class name by prefixing with "class:" @param outVertex Source vertex @param inVertex Destination vertex @param label Edge's label @return
com.tinkerpop.blueprints.impls.orient.OrientGraph.addEdge()
com.tinkerpop.blueprints.impls.orient.OrientVertex.addEdge()
Creates an edge between current Vertex and a target Vertex setting label as Edge's label. @param label Edge's label or class @param inVertex Outgoing target vertex @return The new Edge created
com.tinkerpop.blueprints.impls.tg.TinkerGraph.addEdge()
com.tinkerpop.blueprints.util.wrappers.batch.BatchGraph.addEdge()
com.tinkerpop.gremlin.structure.Vertex.addEdge()
Add an outgoing edge to the vertex with provided label and edge properties as key/value pairs. These key/values must be provided in an even number where the odd numbered arguments are {@link String}property keys and the even numbered arguments are the related property values. Hidden properties can be set by specifying the key as {@link com.tinkerpop.gremlin.structure.Graph.Key#hide}. @param label The label of the edge @param inVertex The vertex to receive an incoming edge from the current vertex @param keyValues The key/value pairs to turn into edge properties @return the newly created edge
com.volantis.mcs.utilities.TopologicalSorter.addEdge()
Adds directional edge between specified nodes. Non-existing nodes are added implicitely. @param from The starting node. @param to The ending node.
cu.repsystestbed.graphs.ReputationGraph.addEdge()
Adds the edge if it doesn't exist already. If it exists, the edge weight is updated. @param src @param sink @param reputation
cu.repsystestbed.graphs.TrustGraph.addEdge()
de.hpi.bpt.graph.DirectedGraph.addEdge()
de.hpi.eworld.exporter.sumo.data.SumoRoute.addEdge()
Adds an edge to this route. @param edgeid The ID of the edge to add.
de.hpi.eworld.model.db.data.event.CircleLocationModel.addEdge()
de.hpi.eworld.model.db.data.event.EdgeLocationModel.addEdge()
de.timefinder.algo.graph.Matching.addEdge()
de.timefinder.algo.graph.WeightedGraph.addEdge()
dk.brics.xact.analysis.flowgraph.FlowGraph.addEdge()
edu.brown.designer.AccessGraph.addEdge()
edu.brown.designer.DependencyGraph.addEdge()
edu.brown.markov.MarkovGraph.addEdge()
edu.cmu.graphchi.preprocessing.FastSharder.addEdge()
Adds an edge to the preprocessing. @param from @param to @param edgeValueToken @throws IOException
edu.cmu.sphinx.result.Lattice.addEdge()
Add an edge from fromNode to toNode. This method creates the Edge object and does all the connecting @param fromNode @param toNode @param acousticScore @param lmScore @return the new Edge
edu.indiana.extreme.xbaya.graph.Graph.addEdge()
Adds an edge between two ports specified. If the edge already exists between two ports, it returns null without creating a new one. @param fromPort The port the edge is connected from @param toPort The port the edge is connected to @return The edge added @throws GraphException
edu.indiana.extreme.xbaya.graph.ws.WSGraph.addEdge()
edu.stanford.nlp.semgraph.SemanticGraph.addEdge()
edu.uci.ics.jung.graph.DirectedSparseGraph.addEdge()
edu.uci.ics.jung.graph.DirectedSparseMultigraph.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)
edu.uci.ics.jung.graph.impl.DirectedSparseGraph.addEdge()
instantbach.data.Graph.addEdge()
Adds a new Edge to the graph (adds the edge to the vertex of sourceName and the cost to get there) @param sourceName String @param destName String @param cost double
net.wigis.graph.dnv.DNVGraph.addEdge()
nl.nanoworks.nanograph.model.DefaultGraphModel.addEdge()
noop.model.Library.addEdge()
org._3pq.jgrapht.DirectedGraph.addEdge()
org._3pq.jgrapht.UndirectedGraph.addEdge()
org._3pq.jgrapht.graph.DefaultDirectedGraph.addEdge()
org._3pq.jgrapht.graph.ListenableUndirectedGraph.addEdge()
org._3pq.jgrapht.graph.SimpleGraph.addEdge()
org.antlr.misc.Graph.addEdge()
org.apache.airavata.workflow.model.graph.Graph.addEdge()
Adds an edge between two ports specified. If the edge already exists between two ports, it returns null without creating a new one. @param fromPort The port the edge is connected from @param toPort The port the edge is connected to @return The edge added @throws GraphException
org.apache.airavata.workflow.model.graph.ws.WSGraph.addEdge()
org.apache.airavata.xbaya.graph.Graph.addEdge()
Adds an edge between two ports specified. If the edge already exists between two ports, it returns null without creating a new one. @param fromPort The port the edge is connected from @param toPort The port the edge is connected to @return The edge added @throws GraphException
org.apache.airavata.xbaya.graph.ws.WSGraph.addEdge()
org.apache.hama.graph.example.PageRank.PageRankVertex.addEdge()
org.apache.tez.dag.api.DAG.addEdge()
Add an {@link Edge} connecting vertices in the DAG @param edge The edge to be added @return {@link DAG}
org.apache.xmlgraphics.util.dijkstra.DefaultEdgeDirectory.addEdge()
Adds a new edge between two vertices. @param edge the new edge
org.codehaus.plexus.graph.contract.Contract.addEdge()
Adds a feature to the Edge attribute of the Contract object
org.codehaus.plexus.graph.domain.basic.DefaultDirectedGraph.addEdge()
Adds a feature to the Edge attribute of the DefaultDirectedGraph object
org.codehaus.plexus.util.dag.DAG.addEdge()
org.eclipse.ui.internal.texteditor.rulers.DAG.addEdge()
Adds a directed edge from origin to target. The vertices are not required to exist prior to this call - if they are not currently contained by the graph, they are automatically added. @param origin the origin vertex of the dependency @param target the target vertex of the dependency @return true if the edge was added, false if theedge was not added because it would have violated the acyclic nature of the receiver.
org.geotools.graph.build.GraphBuilder.addEdge()
Adds an edge to the graph. @param edge Edge to be added to graph.
org.gephi.graph.api.DirectedGraph.addEdge()
Add an edge between source and target to the graph. Graph does not accept parallel edges. Fails if a such edge already exists in the graph. @param source the source node @param target the target node @return true if add is successful, false otherwise @throws IllegalArgumentException if source or targetis null or not legal nodes for this edge @throws IllegalMonitorStateException if the current thread is holding a read lock
org.gephi.graph.api.Graph.addEdge()
Add edge to the graph. Graph does not accept parallel edges. Fails if edge is already in the graph. @param edge the edge to add @return true if add is successful, false otherwise @throws IllegalArgumentException if edge is null,or if nodes are not legal nodes for this edge, or if edge is directed when the graph is undirected, or if edge is undirected when the graph is directed, @throws IllegalMonitorStateException if the current thread is holding a read lock
org.gephi.graph.api.HierarchicalDirectedGraph.addEdge()
org.gephi.graph.api.HierarchicalGraph.addEdge()
org.gephi.graph.api.UndirectedGraph.addEdge()
Add an undirected edge betweennode1 and node2to the graph. Graph does not accept parallel edges. Fails if a such edge already exists in the graph. @param node1 the first node @param node2 the second node @return true if add is successful, false otherwise @throws IllegalArgumentException if source or targetis null or not legal nodes for this edge @throws IllegalMonitorStateException if the current thread is holding a read lock
org.gephi.graph.dhns.edge.MetaEdgeImpl.addEdge()
org.gephi.graph.dhns.graph.HierarchicalDirectedGraphImpl.addEdge()
org.gephi.graph.dhns.graph.HierarchicalUndirectedGraphImpl.addEdge()
org.gephi.visualization.model.node.NodeModel.addEdge()
org.graphstream.graph.Graph.addEdge()
Like {@link #addEdge(String,String,String)} but the nodes areidentified by their indices. @param id Unique and arbitrary string identifying the edge. @param index1 The first node index @param index2 The second node index @return The newly created edge, an existing edge or {@code null} @throws IndexOutOfBoundsException If node indices are negative or greater than {@code getNodeCount() - 1} @throws IdAlreadyInUseException If an edge with the same id already exists and strict checking is enabled. @throws EdgeRejectedException If strict checking is enabled and the edge is not accepted. @see #addEdge(String,String,String)
org.graphstream.graph.implementations.AbstractGraph.addEdge()
org.graphstream.graph.implementations.AdjacencyListGraph.addEdge()
org.graphstream.graph.implementations.DefaultGraph.addEdge()
org.graphstream.graph.implementations.MultiGraph.addEdge()
org.graphstream.graph.implementations.SingleGraph.addEdge()
org.integratedmodelling.riskwiz.bn.BeliefNetwork.addEdge()
org.jamesii.core.util.graph.SimpleGraph.addEdge()
org.jamesii.core.util.graph.trees.SimpleTree.addEdge()
org.jamesii.perfdb.recording.selectiontrees.SelectionTree.addEdge()
org.jgraph.graph.Port.addEdge()
Adds edge to the list of ports.
org.jgrapht.graph.DirectedSubgraph.addEdge()
org.jgrapht.graph.SimpleDirectedGraph.addEdge()
org.jruby.ir.representations.CFG.addEdge()
org.lab41.dendrite.metagraph.DendriteGraphTx.addEdge()
org.mindswap.pellet.EdgeList.addEdge()
org.nanograph.model.DefaultGraphModel.addEdge()
org.openjgraph.model.Graph.addEdge()
Cette méthode permet de rajouter une arête valuée à un graphe @param head tete de l'arete @param tail queue de l'arete @param value valeur de l'arete @throws VertexNotFoundException cette exception est renvoyée lorsque
org.openjgraph.model.adjacencymatrix.AdjacencyMatrixDirectedGraph.addEdge()
Cette méthode permet d'ajouter une arête valuée au graphe. @param firstVertex sommet se trouvant à l'extremité de l'arête @param secondVertex sommet se trouvant à l'autre extremité de l'arête @throws VertexNotFoundException exception renvoyée lorsque l'un des deuxsommet n'est pas présent dans le graphe.
org.openjgraph.model.adjacencymatrix.AdjacencyMatrixGraph.addEdge()
Cette méthode permet d'ajouter une arête non valuée au graphe. La valeur de l'arête correspond à 1. @param firstVertex sommet se trouvant à l'extremité de l'arête @param secondVertex sommet se trouvant à l'autre extremité de l'arête @throws VertexNotFoundException exception renvoyée lorsque l'un des deuxsommet n'est pas présent dans le graphe.
org.openntf.domino.graph.DominoGraph.addEdge()
org.opensphere.geometry.triangulation.model.Triangle.addEdge()
Add an edge to the triangle. @return true if added, false otherwise
org.patika.mada.util.CausativePath.addEdge()
org.patika.mada.util.Path.addEdge()
Adds an edge to the path.
org.teavm.common.GraphBuilder.addEdge()
prefuse.data.Graph.addEdge()
Add an edge to the graph. Both multiple edges between two nodes and edges from a node to itself are allowed. @param s the source node id @param t the target node id @return the edge id (edge table row number) of the added edge
project.gluebooster.math.functions.DefaultGraphForFunctionByEventsourceGraph.addEdge()
ptolemy.graph.DirectedAcyclicGraph.addEdge()
ptolemy.graph.DirectedGraph.addEdge()
ptolemy.graph.Graph.addEdge()
Add a weighted edge between two nodes. If the edge is subsequently operated on as a directed edge, its orientation will be taken to be directed from the first (node1) node to the second (node2) node. Multiple edges between the same nodes are allowed, and are considered different edges. Self-loops are also allowed. @param node1 The first node. @param node2 The second node. @param weight The weight. @return The edge. @exception GraphElementException If the first node or secondnode is not already in the graph. @exception NullPointerException If the weight is null.
soot.toolkits.graph.HashMutableDirectedGraph.addEdge()
soot.toolkits.graph.HashMutableEdgeLabelledDirectedGraph.addEdge()
soot.toolkits.graph.MutableEdgeLabelledDirectedGraph.addEdge()
unbbayes.prs.mebn.MFrag.addEdge()

Examples of org._3pq.jgrapht.graph.DefaultDirectedGraph.addEdge()

        if(!dg.containsVertex(child)) {
          dg.addVertex(child);
        }
        //add edge, precondition: vertex key - child are already added to the graph
        Edge de = def.createEdge(key, child);
        dg.addEdge(de);
      }
    }
    /*
     * find the id's participating in the cycle, and return the intersection
     * with set of id's which actually produce references.

View Full Code Here

Examples of org._3pq.jgrapht.graph.ListenableUndirectedGraph.addEdge()

    while (edgesAdded < numCliques - 1) {
      VarSet[] pair = (VarSet[]) pq.first();
      pq.remove(pair);


      if (!inspector.pathExists(pair[0], pair[1])) {
          g.addEdge(pair[0], pair[1]);
          edgesAdded++;
      }
    }


    JunctionTree jt = graphToJt(g);

View Full Code Here

Examples of org._3pq.jgrapht.graph.SimpleGraph.addEdge()

      Factor factor = (Factor) it.next ();
      VarSet varSet = factor.varSet ();
      int nv = varSet.size ();
      for (int i = 0; i < nv; i++) {
        for (int j = i + 1; j < nv; j++) {
          g.addEdge (varSet.get (i), varSet.get (j));
        }
      }
    }


    return g;

View Full Code Here

Examples of org.antlr.misc.Graph.addEdge()

                GrammarSpelunker grammar = new GrammarSpelunker(inputDirectory, gfile);
                grammar.parse();
                String vocabName = grammar.getTokenVocab();
                String grammarName = grammar.getGrammarName();
                // Make all grammars depend on any tokenVocab options
                if ( vocabName!=null ) g.addEdge(gfile, vocabName+CodeGenerator.VOCAB_FILE_EXTENSION);
                // Make all generated tokens files depend on their grammars
                g.addEdge(grammarName+CodeGenerator.VOCAB_FILE_EXTENSION, gfile);
            }
            catch (FileNotFoundException fnfe) {
                ErrorManager.error(ErrorManager.MSG_CANNOT_OPEN_FILE, gfile);

View Full Code Here

Examples of org.apache.airavata.workflow.model.graph.Graph.addEdge()


        OutputNode outParamNode = (OutputNode) workflow.addNode(this.outputComponent);
        outParamNode.setPosition(new Point(370, 240));


        // Connect ports
        graph.addEdge(paramNode1.getOutputPort(0), adderNode1.getInputPort(0));
        graph.addEdge(paramNode2.getOutputPort(0), adderNode1.getInputPort(1));
        graph.addEdge(paramNode3.getOutputPort(0), adderNode2.getInputPort(0));
        graph.addEdge(paramNode4.getOutputPort(0), adderNode2.getInputPort(1));
        graph.addEdge(adderNode1.getOutputPort(0), multiNode.getInputPort(0));
        graph.addEdge(adderNode2.getOutputPort(0), multiNode.getInputPort(1));

View Full Code Here

Examples of org.apache.airavata.workflow.model.graph.ws.WSGraph.addEdge()


        Node multiplier2 = workflow.addNode(multiplierComponent);
        multiplier2.setPosition(new Point(170, 210));
        repaintAndWait(1);


        graph.addEdge(c.getOutputPort(0), multiplier2.getInputPort(0));
        repaintAndWait(1);


        graph.addEdge(d.getOutputPort(0), multiplier2.getInputPort(1));
        repaintAndWait(1);

View Full Code Here

Examples of org.apache.airavata.xbaya.graph.Graph.addEdge()


            for (int i = 0; i < outputPorts.size(); ++i) {
                List<Port> toPorts = this.node.getOutputPort(i).getToPorts();
                for (Port port : toPorts) {
                    graph.removeEdge(this.node.getOutputPort(i), port);
                    graph.addEdge(outputPorts.get(i), port);
                }


            }


            this.engine.getWorkflow().removeNode(this.node);

View Full Code Here

Examples of org.apache.airavata.xbaya.graph.ws.WSGraph.addEdge()

        // Output parameter
        OutputNode outParamNode = (OutputNode) workflow.addNode(outputComponent);
        outParamNode.setPosition(new Point(863, 169));


        // Connect ports
        graph.addEdge(confInput.getOutputPort(0), wrfPreNode.getInputPort(0));
        graph.addEdge(confInput.getOutputPort(0), arp2wrfNode.getInputPort(0));
        graph.addEdge(confInput.getOutputPort(0), adasIntNode.getInputPort(1));
        graph.addEdge(confInput.getOutputPort(0), lateralIntNode.getInputPort(1));
        graph.addEdge(confInput.getOutputPort(0), terrainPreNode.getInputPort(0));
        graph.addEdge(terrainPreNode.getOutputPort(0), adasIntNode.getInputPort(2));

View Full Code Here

Examples of org.apache.hama.graph.example.PageRank.PageRankVertex.addEdge()

        PageRankVertex v = new PageRank.PageRankVertex();
        v.setVertexID(new Text(i + ""));
        if (i % 2 == 0) {
          v.setValue(new DoubleWritable(i * 2));
        }
        v.addEdge(new Edge<Text, NullWritable>(new Text((10 - i) + ""), null));


        list.add(v);
      }


      info.init(null, conf, attempt);

View Full Code Here

Examples of org.apache.tez.dag.api.DAG.addEdge()

          
          // finally we can create the grouped edge
          GroupInputEdge e = utils.createEdge(group, workToConf.get(v),
               workToVertex.get(v), work.getEdgeProperty(w, v));


          dag.addEdge(e);
        }
      } else {
        // Regular vertices
        JobConf wxConf = utils.initializeVertexConf(conf, w);
        Vertex wx = utils.createVertex(wxConf, w, scratchDir, appJarLr,

View Full Code Here

0 1 2 3 4 5 6 7 8 9 10 11

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.