Here are the examples of the java api org._3pq.jgrapht.Edge taken from open source projects. By voting up you can indicate which examples are most useful and appropriate.
54 Examples
19
Source : tar_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see Graph#removeEdge(Edge)
*/
public boolean removeEdge(Edge e) {
if (containsEdge(e)) {
m_specifics.removeEdgeFromTouchingVertices(e);
m_edgeSet.remove(e);
return true;
} else {
return false;
}
}
19
Source : tar_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see org._3pq.jgrapht.WeightedGraph#addEdge(Object, Object, double)
*/
public Edge addEdge(Object sourceVertex, Object targetVertex, double weight) {
Edge e = addEdge(sourceVertex, targetVertex);
if (e != null) {
((WeightedElement) e).setWeight(weight);
}
return e;
}
19
Source : tar_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see Graph#removeVertex(Object)
*/
public boolean removeVertex(Object v) {
if (containsVertex(v)) {
List touchingEdgesList = edgesOf(v);
// cannot iterate over list - will cause ConcurrentModificationException
Edge[] touchingEdges = new Edge[touchingEdgesList.size()];
touchingEdgesList.toArray(touchingEdges);
removeAllEdges(touchingEdges);
// remove the vertex itself
m_vertexMap.remove(v);
return true;
} else {
return false;
}
}
19
Source : tar_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see Graph#containsEdge(Edge)
*/
public boolean containsEdge(Edge e) {
return m_edgeSet.contains(e);
}
19
Source : tar_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
private boolean removeAllEdges(Edge[] edges) {
boolean modified = false;
for (int i = 0; i < edges.length; i++) {
modified |= removeEdge(edges[i]);
}
return modified;
}
19
Source : tar_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
private boolean replacedertCompatibleWithEdgeFactory(Edge e) {
if (e == null) {
throw new NullPointerException();
} else if (!m_factoryEdgeClreplaced.isInstance(e)) {
throw new ClreplacedCastException("incompatible edge clreplaced");
}
return true;
}
19
Source : tar_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
private void addAllEdgeClones(Set edgeSet) {
for (Iterator iter = edgeSet.iterator(); iter.hasNext(); ) {
Edge e = (Edge) iter.next();
addEdge((Edge) e.clone());
}
}
19
Source : tar_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see Graph#removeEdge(Object, Object)
*/
public Edge removeEdge(Object sourceVertex, Object targetVertex) {
Edge e = getEdge(sourceVertex, targetVertex);
if (e != null) {
m_specifics.removeEdgeFromTouchingVertices(e);
m_edgeSet.remove(e);
}
return e;
}
19
Source : src_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
private void replacedertCompatibleWithEdgeFactory(Edge e) {
if (e == null) {
throw new NullPointerException();
} else if (!m_factoryEdgeClreplaced.isInstance(e)) {
throw new ClreplacedCastException("incompatible edge clreplaced");
}
}
19
Source : src_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see org._3pq.jgrapht.traverse.CrossComponenreplacederator#encounterVertexAgain(java.lang.Object,
* org._3pq.jgrapht.Edge)
*/
protected void encounterVertexAgain(Object vertex, Edge edge) {
}
19
Source : src_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see org._3pq.jgrapht.traverse.CrossComponenreplacederator#encounterVertex(java.lang.Object,
* org._3pq.jgrapht.Edge)
*/
protected void encounterVertex(Object vertex, Edge edge) {
putSeenData(vertex, null);
m_queue.addLast(vertex);
}
19
Source : src_0.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see org._3pq.jgrapht.traverse.CrossComponenreplacederator#encounterVertex(java.lang.Object,
* org._3pq.jgrapht.Edge)
*/
protected void encounterVertex(Object vertex, Edge edge) {
putSeenData(vertex, null);
m_stack.add(vertex);
}
19
Source : tar_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see org._3pq.jgrapht.Graph#containsEdge(Edge)
*/
public boolean containsEdge(Edge e) {
return m_edgeSet.contains(e);
}
19
Source : tar_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
private void addEdgesUsingFilter(Set edgeSet, Set filter) {
Edge e;
boolean containsVertices;
boolean edgeIncluded;
for (Iterator i = edgeSet.iterator(); i.hasNext(); ) {
e = (Edge) i.next();
containsVertices = containsVertex(e.getSource()) && containsVertex(e.getTarget());
// note the use of short circuit evaluation
edgeIncluded = (filter == null) || filter.contains(e);
if (containsVertices && edgeIncluded) {
addEdge(e);
}
}
}
19
Source : tar_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see org._3pq.jgrapht.Graph#getAllEdges(Object, Object)
*/
public List getAllEdges(Object sourceVertex, Object targetVertex) {
List edges = null;
if (containsVertex(sourceVertex) && containsVertex(targetVertex)) {
edges = new ArrayList();
List baseEdges = m_base.getAllEdges(sourceVertex, targetVertex);
for (Iterator i = baseEdges.iterator(); i.hasNext(); ) {
Edge e = (Edge) i.next();
if (m_edgeSet.contains(e)) {
// add if subgraph also contains it
edges.add(e);
}
}
}
return edges;
}
19
Source : tar_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see org._3pq.jgrapht.Graph#removeEdge(Object, Object)
*/
public Edge removeEdge(Object sourceVertex, Object targetVertex) {
Edge e = getEdge(sourceVertex, targetVertex);
return m_edgeSet.remove(e) ? e : null;
}
19
Source : tar_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see org._3pq.jgrapht.Graph#removeEdge(Edge)
*/
public boolean removeEdge(Edge e) {
return m_edgeSet.remove(e);
}
19
Source : tar_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see org._3pq.jgrapht.Graph#edgesOf(Object)
*/
public List edgesOf(Object vertex) {
replacedertVertexExist(vertex);
ArrayList edges = new ArrayList();
List baseEdges = m_base.edgesOf(vertex);
for (Iterator i = baseEdges.iterator(); i.hasNext(); ) {
Edge e = (Edge) i.next();
if (containsEdge(e)) {
edges.add(e);
}
}
return edges;
}
19
Source : src_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
private void replacedertBaseContainsEdgeInstance(Edge e) {
if (!m_verifyIntegrity) {
return;
}
List baseEdges = m_base.getAllEdges(e.getSource(), e.getTarget());
for (Iterator i = baseEdges.iterator(); i.hasNext(); ) {
Edge baseEdge = (Edge) i.next();
if (e.equals(baseEdge)) {
if (e != baseEdge) {
throw new IllegalArgumentException(REF_NOT_EQUAL_TO_BASE);
}
return;
}
}
}
19
Source : src_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see org._3pq.jgrapht.Graph#getAllEdges(Object, Object)
*/
public List getAllEdges(Object sourceVertex, Object targetVertex) {
List edges = null;
if (containsVertex(sourceVertex) && containsVertex(targetVertex)) {
edges = new ArrayList();
List baseEdges = m_base.getAllEdges(sourceVertex, targetVertex);
for (Iterator iter = baseEdges.iterator(); iter.hasNext(); ) {
Edge e = (Edge) iter.next();
if (m_edgeSet.contains(e)) {
// add if subgraph also contains it
edges.add(e);
}
}
}
return edges;
}
19
Source : src_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* NOTE: We allow to remove an edge by the specified "value-equal" edge
* that denotes it, which is not necessarily "reference-equal" to the edge
* to be removed.
*
* @see org._3pq.jgrapht.Graph#removeEdge(Edge)
*/
public boolean removeEdge(Edge e) {
return m_edgeSet.remove(e);
}
19
Source : src_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see org._3pq.jgrapht.Graph#edgesOf(Object)
*/
public List edgesOf(Object vertex) {
replacedertVertexExist(vertex);
ArrayList edges = new ArrayList();
List baseEdges = m_base.edgesOf(vertex);
for (Iterator iter = baseEdges.iterator(); iter.hasNext(); ) {
Edge e = (Edge) iter.next();
if (containsEdge(e)) {
edges.add(e);
}
}
return edges;
}
19
Source : src_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
private void addEdgesUsingFilter(Set edgeSet, Set filter) {
Edge e;
boolean containsVertices;
boolean edgeIncluded;
for (Iterator iter = edgeSet.iterator(); iter.hasNext(); ) {
e = (Edge) iter.next();
containsVertices = containsVertex(e.getSource()) && containsVertex(e.getTarget());
// note the use of short circuit evaluation
edgeIncluded = (filter == null) || filter.contains(e);
if (containsVertices && edgeIncluded) {
addEdge(e);
}
}
}
19
Source : tar_2.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* Returns a list of vertices that are the successors of a specified
* vertex. If the graph is a multigraph vertices may appear more than once
* in the returned list.
*
* @param g the graph to look for successors in.
* @param vertex the vertex to get the successors of.
*
* @return a list of the vertices that are the successors of the specified
* vertex.
*/
public static <V, E extends Edge<V>> List<V> successorListOf(DirectedGraph<V, E> g, V vertex) {
List successors = new ArrayList();
List edges = g.outgoingEdgesOf(vertex);
for (Iterator i = edges.iterator(); i.hasNext(); ) {
Edge e = (Edge) i.next();
successors.add(e.oppositeVertex(vertex));
}
return successors;
}
19
Source : tar_2.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* Returns a list of vertices that are the predecessors of a specified
* vertex. If the graph is a multigraph, vertices may appear more than
* once in the returned list.
*
* @param g the graph to look for predecessors in.
* @param vertex the vertex to get the predecessors of.
*
* @return a list of the vertices that are the predecessors of the
* specified vertex.
*/
public static <V, E extends Edge<V>> List<V> predecessorListOf(DirectedGraph<V, E> g, V vertex) {
List predecessors = new ArrayList();
List edges = g.incomingEdgesOf(vertex);
for (Iterator i = edges.iterator(); i.hasNext(); ) {
Edge e = (Edge) i.next();
predecessors.add(e.oppositeVertex(vertex));
}
return predecessors;
}
19
Source : tar_2.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* Returns a list of vertices that are the neighbors of a specified vertex.
* If the graph is a multigraph vertices may appear more than once in the
* returned list.
*
* @param g the graph to look for neighbors in.
* @param vertex the vertex to get the neighbors of.
*
* @return a list of the vertices that are the neighbors of the specified
* vertex.
*/
public static <V, E extends Edge<V>> List<V> neighborListOf(Graph<V, E> g, V vertex) {
List neighbors = new ArrayList();
for (Iterator i = g.edgesOf(vertex).iterator(); i.hasNext(); ) {
Edge e = (Edge) i.next();
neighbors.add(e.oppositeVertex(vertex));
}
return neighbors;
}
19
Source : tar_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* Helper for findPathBetween.
*
* @param iter a ClosestFirsreplacederator which has already visited endVertex
* @param endVertex the vertex being sought
*
* @return non-null result for findPathBetween
*/
private static List createPath(ClosestFirsreplacederator iter, Object endVertex) {
List path = new ArrayList();
while (true) {
Edge edge = iter.getSpanningTreeEdge(endVertex);
if (edge == null) {
break;
}
path.add(edge);
endVertex = edge.oppositeVertex(endVertex);
}
Collections.reverse(path);
return path;
}
19
Source : src_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* Helper for findPathBetween.
*
* @param iter a ClosestFirsreplacederator which has already visited endVertex
* @param endVertex the vertex being sought
*
* @return non-null result for findPathBetween
*/
private static List createPath(ClosestFirsreplacederator iter, Object endVertex) {
List path = new ArrayList();
for (; ; ) {
Edge edge = iter.getSpanningTreeEdge(endVertex);
if (edge == null) {
break;
}
path.add(edge);
endVertex = edge.oppositeVertex(endVertex);
}
Collections.reverse(path);
return path;
}
19
Source : src_0.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
private void createEdgeList(ClosestFirsreplacederator iter, Object endVertex) {
m_edgeList = new ArrayList();
while (true) {
Edge edge = iter.getSpanningTreeEdge(endVertex);
if (edge == null) {
break;
}
m_edgeList.add(edge);
endVertex = edge.oppositeVertex(endVertex);
}
Collections.reverse(m_edgeList);
}
19
Source : src_4.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see Graph#addEdge(Edge)
*/
public boolean addEdge(Edge e) {
throw new UnsupportedOperationException(UNMODIFIABLE);
}
19
Source : src_4.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see Graph#removeEdge(Edge)
*/
public boolean removeEdge(Edge e) {
throw new UnsupportedOperationException(UNMODIFIABLE);
}
19
Source : src_2.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see Graph#addEdge(Edge)
*/
public boolean addEdge(Edge e) {
boolean modified = super.addEdge(e);
if (modified) {
fireEdgeAdded(e);
}
return modified;
}
19
Source : src_2.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see Graph#removeEdge(Edge)
*/
public boolean removeEdge(Edge e) {
boolean modified = super.removeEdge(e);
if (modified) {
fireEdgeRemoved(e);
}
return modified;
}
19
Source : src_2.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* Notify listeners that the specified edge was added.
*
* @param edge the edge that was added.
*/
protected void fireEdgeAdded(Edge edge) {
GraphEdgeChangeEvent e = createGraphEdgeChangeEvent(GraphEdgeChangeEvent.EDGE_ADDED, edge);
for (int i = 0; i < m_graphListeners.size(); i++) {
GraphListener l = (GraphListener) m_graphListeners.get(i);
l.edgeAdded(e);
}
}
19
Source : src_2.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see Graph#addEdge(Object, Object)
*/
public Edge addEdge(Object sourceVertex, Object targetVertex) {
Edge e = super.addEdge(sourceVertex, targetVertex);
if (e != null) {
fireEdgeAdded(e);
}
return e;
}
19
Source : src_2.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* Notify listeners that the specified edge was removed.
*
* @param edge the edge that was removed.
*/
protected void fireEdgeRemoved(Edge edge) {
GraphEdgeChangeEvent e = createGraphEdgeChangeEvent(GraphEdgeChangeEvent.EDGE_REMOVED, edge);
for (int i = 0; i < m_graphListeners.size(); i++) {
GraphListener l = (GraphListener) m_graphListeners.get(i);
l.edgeRemoved(e);
}
}
19
Source : src_2.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
private GraphEdgeChangeEvent createGraphEdgeChangeEvent(int eventType, Edge edge) {
if (m_reuseEvents) {
m_reuseableEdgeEvent.setType(eventType);
m_reuseableEdgeEvent.setEdge(edge);
return m_reuseableEdgeEvent;
} else {
return new GraphEdgeChangeEvent(this, eventType, edge);
}
}
19
Source : src_2.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see Graph#removeVertex(Object)
*/
public boolean removeVertex(Object v) {
if (containsVertex(v)) {
List touchingEdgesList = edgesOf(v);
// cannot iterate over list - will cause ConcurrentModificationException
Edge[] touchingEdges = new Edge[touchingEdgesList.size()];
touchingEdgesList.toArray(touchingEdges);
removeAllEdges(touchingEdges);
// remove the vertex itself
super.removeVertex(v);
fireVertexRemoved(v);
return true;
} else {
return false;
}
}
19
Source : src_2.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see Graph#removeEdge(Object, Object)
*/
public Edge removeEdge(Object sourceVertex, Object targetVertex) {
Edge e = super.removeEdge(sourceVertex, targetVertex);
if (e != null) {
fireEdgeRemoved(e);
}
return e;
}
19
Source : src_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see Graph#addEdge(Edge)
*/
public boolean addEdge(Edge e) {
return m_delegate.addEdge(e);
}
19
Source : src_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see Graph#removeEdge(Edge)
*/
public boolean removeEdge(Edge e) {
return m_delegate.removeEdge(e);
}
19
Source : src_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see Graph#containsEdge(Edge)
*/
public boolean containsEdge(Edge e) {
return m_delegate.containsEdge(e);
}
19
Source : src_0.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see DirectedGraph#outgoingEdgesOf(Object)
*/
public List outgoingEdgesOf(Object vertex) {
replacedertVertexExist(vertex);
ArrayList edges = new ArrayList();
List baseEdges = ((DirectedGraph) m_base).outgoingEdgesOf(vertex);
for (Iterator i = baseEdges.iterator(); i.hasNext(); ) {
Edge e = (Edge) i.next();
if (containsEdge(e)) {
edges.add(e);
}
}
return edges;
}
19
Source : src_0.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see UndirectedGraph#degreeOf(Object)
*/
public int degreeOf(Object vertex) {
replacedertVertexExist(vertex);
// sophisticated way to check runtime clreplaced of base ;-)
((UndirectedGraph) m_base).degreeOf(vertex);
int degree = 0;
for (Iterator i = m_base.edgesOf(vertex).iterator(); i.hasNext(); ) {
Edge e = (Edge) i.next();
if (containsEdge(e)) {
degree++;
if (e.getSource().equals(e.getTarget())) {
degree++;
}
}
}
return degree;
}
19
Source : src_0.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see DirectedGraph#incomingEdgesOf(Object)
*/
public List incomingEdgesOf(Object vertex) {
replacedertVertexExist(vertex);
ArrayList edges = new ArrayList();
List baseEdges = ((DirectedGraph) m_base).incomingEdgesOf(vertex);
for (Iterator i = baseEdges.iterator(); i.hasNext(); ) {
Edge e = (Edge) i.next();
if (containsEdge(e)) {
edges.add(e);
}
}
return edges;
}
19
Source : TRP.java
with MIT License
from simoneSantoni
with MIT License
from simoneSantoni
private static cc.mallet.grmm.types.Tree graphToTree(Graph g) throws Exception {
// Perhaps handle gracefully?? -cas
if (g.vertexSet().size() <= 0) {
throw new RuntimeException("Empty graph.");
}
Tree tree = new cc.mallet.grmm.types.Tree();
Object root = g.vertexSet().iterator().next();
tree.add(root);
for (Iterator it1 = new BreadthFirsreplacederator(g, root); it1.hasNext(); ) {
Object v1 = it1.next();
for (Iterator it2 = g.edgesOf(v1).iterator(); it2.hasNext(); ) {
Edge edge = (Edge) it2.next();
Object v2 = edge.oppositeVertex(v1);
if (tree.getParent(v1) != v2) {
tree.addNode(v1, v2);
replacedert tree.getParent(v2) == v1;
}
}
}
return tree;
}
18
Source : tar_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see Graph#addEdge(Edge)
*/
public boolean addEdge(Edge e) {
if (e == null) {
throw new NullPointerException();
} else if (containsEdge(e)) {
return false;
}
Object sourceVertex = e.getSource();
Object targetVertex = e.getTarget();
replacedertVertexExist(sourceVertex);
replacedertVertexExist(targetVertex);
replacedertCompatibleWithEdgeFactory(e);
if (!m_allowingMultipleEdges && containsEdge(sourceVertex, targetVertex)) {
return false;
}
if (!m_allowingLoops && sourceVertex.equals(targetVertex)) {
throw new IllegalArgumentException(LOOPS_NOT_ALLOWED);
}
m_edgeSet.add(e);
m_specifics.addEdgeToTouchingVertices(e);
return true;
}
18
Source : tar_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see Graph#addEdge(Object, Object)
*/
public Edge addEdge(Object sourceVertex, Object targetVertex) {
replacedertVertexExist(sourceVertex);
replacedertVertexExist(targetVertex);
if (!m_allowingMultipleEdges && containsEdge(sourceVertex, targetVertex)) {
return null;
}
if (!m_allowingLoops && sourceVertex.equals(targetVertex)) {
throw new IllegalArgumentException(LOOPS_NOT_ALLOWED);
}
Edge e = m_edgeFactory.createEdge(sourceVertex, targetVertex);
if (containsEdge(e)) {
// this restriction should stay!
return null;
} else {
m_edgeSet.add(e);
m_specifics.addEdgeToTouchingVertices(e);
return e;
}
}
18
Source : src_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see Graph#addEdge(Edge)
*/
public boolean addEdge(Edge e) {
if (e == null) {
throw new NullPointerException();
} else if (containsEdge(e)) {
return false;
}
Object sourceVertex = e.getSource();
Object targetVertex = e.getTarget();
replacedertVertexExist(sourceVertex);
replacedertVertexExist(targetVertex);
replacedertCompatibleWithEdgeFactory(e);
if (!m_multipleEdgesAllowed && containsEdge(sourceVertex, targetVertex)) {
return false;
}
if (!m_loopsAllowed && sourceVertex.equals(targetVertex)) {
throw new IllegalArgumentException(LOOPS_NOT_ALLOWED);
}
m_edgeSet.add(e);
m_specifics.addEdgeToTouchingVertices(e);
return true;
}
18
Source : src_1.java
with GNU General Public License v2.0
from xgdsmileboy
with GNU General Public License v2.0
from xgdsmileboy
/**
* @see Graph#addEdge(Object, Object)
*/
public Edge addEdge(Object sourceVertex, Object targetVertex) {
replacedertVertexExist(sourceVertex);
replacedertVertexExist(targetVertex);
if (!m_multipleEdgesAllowed && containsEdge(sourceVertex, targetVertex)) {
return null;
}
if (!m_loopsAllowed && sourceVertex.equals(targetVertex)) {
throw new IllegalArgumentException(LOOPS_NOT_ALLOWED);
}
Edge e = m_edgeFactory.createEdge(sourceVertex, targetVertex);
if (containsEdge(e)) {
// this restriction should stay!
return null;
} else {
m_edgeSet.add(e);
m_specifics.addEdgeToTouchingVertices(e);
return e;
}
}
See More Examples