/** * @see edu.uci.ics.jung.graph.Hypergraph#containsVertex(java.lang.Object) */ public boolean containsVertex(V vertex) { return delegate.containsVertex(vertex); } }
/** * @see edu.uci.ics.jung.graph.Hypergraph#containsVertex(java.lang.Object) */ @Override public boolean containsVertex(V vertex) { return delegate.containsVertex(vertex); }
/** * @see edu.uci.ics.jung.graph.Hypergraph#containsVertex(java.lang.Object) */ @Override public boolean containsVertex(V vertex) { return delegate.containsVertex(vertex); }
/** * @see edu.uci.ics.jung.graph.Hypergraph#containsVertex(java.lang.Object) */ public boolean containsVertex(V vertex) { return delegate.containsVertex(vertex); } }
/** * @see edu.uci.ics.jung.graph.Hypergraph#containsVertex(java.lang.Object) */ public synchronized boolean containsVertex(V vertex) { return delegate.containsVertex(vertex); }
/** * Returns <code>true</code> if the graph contains the vertex. * @param vertex The vertex. * @return <code>true</code> if the vertex is in the graph. */ public boolean containsVertex(Object vertex) { return delegate.containsVertex(vertex); } /**
/** * @see edu.uci.ics.jung.graph.Hypergraph#containsVertex(java.lang.Object) */ @Override public synchronized boolean containsVertex(V vertex) { return delegate.containsVertex(vertex); }
public boolean FindNodeByIDEntireGraph(String name) { if (name != null && !name.isEmpty()) { if (entireGraph != null) return entireGraph.containsVertex(name); else return false; } else { return false; } }
@Override public V getParent(V child) { if (!delegate.containsVertex(child)) { return null; } Collection<V> parents = delegate.getPredecessors(child); if (parents.size() > 0) { return parents.iterator().next(); } return null; }
/** * @param v the vertex to test * @return <code>true</code> if {@code v} has no children */ public boolean isLeaf(V v) { if (!delegate.containsVertex(v)) return false; return getChildren(v).size() == 0; }
/** * get the number of children of the passed parent node */ @Override public int getChildCount(V parent) { if (!delegate.containsVertex(parent)) { return 0; } return getChildren(parent).size(); }
/** * get the immediate children nodes of the passed parent */ @Override public Collection<V> getChildren(V parent) { if (!delegate.containsVertex(parent)) { return null; } return delegate.getSuccessors(parent); }
/** * get the number of children of the passed parent node */ public int getChildCount(V parent) { if (!delegate.containsVertex(parent)) return 0; return getChildren(parent).size(); }
/** * @param v the vertex to test * @return <code>true</code> if {@code v} has no parent */ public boolean isRoot(V v) { if (!delegate.containsVertex(v)) return false; return getParent(v) == null; }
/** * get the single parent node of the passed child */ @Override public V getParent(V child) { if (!delegate.containsVertex(child)) { return null; } Collection<V> predecessors = delegate.getPredecessors(child); if (predecessors.size() == 0) { return null; } return predecessors.iterator().next(); }
/** * Returns <code>true</code> if the passed node has no children. * * @return <code>true</code> if the passed node has no children */ public boolean isLeaf(V v) { if (!delegate.containsVertex(v)) { return false; } return getChildren(v).size() == 0; }
/** * computes whether the passed node is a root node (has no children) */ public boolean isRoot(V v) { if (!delegate.containsVertex(v)) { return false; } return getParent(v) == null; }
/** * get the immediate children nodes of the passed parent */ public Collection<V> getChildren(V parent) { if (!delegate.containsVertex(parent)) return null; return delegate.getSuccessors(parent); }
/** * @param v the vertex to test * @return <code>true</code> if <code>v</code> is neither * a leaf nor the root of this tree */ public boolean isInternal(V v) { if (!delegate.containsVertex(v)) return false; return isLeaf(v) == false && isRoot(v) == false; }
/** * Returns <code>true</code> if <code>v</code> is neither a leaf nor the * root of this tree. * * @return <code>true</code> if <code>v</code> is neither a leaf nor the * root of this tree */ public boolean isInternal(V v) { if (!delegate.containsVertex(v)) { return false; } return isLeaf(v) == false && isRoot(v) == false; }