src/main/java/de/dfki/lt/loot/digraph/DirectedBiGraph.java
public boolean hasInEdges(int vertex) {
    EdgeContainer<EdgeInfo> result = _inEdges.get(vertex);
    if (result == null) return false;
    return ! result.isEmpty();
  }
/** Return true if the node has at least one incoming edge. */
Return true if the node has at least one incoming edge.
Return true if the node has at least one incoming edge .
public boolean hasInEdges(int vertex) {
    EdgeContainer<EdgeInfo> result = _inEdges.get(vertex);
    if (result == null) return false;
    return ! result.isEmpty();
  }
public boolean hasInEdges ( int vertex ) { EdgeContainer < EdgeInfo > result = _inEdges . get ( vertex ) ; if ( result == null ) return false ; return ! result . isEmpty ( ) ; }
Return true if the node has at least one incoming edge.
Return true if the node has at least one incoming edge .