void function ( K arg0 , K arg1 ) { HashMap < K , T > loc0 = getEdges ( arg0 ) ; if ( ! loc0 . isEmpty ( ) && loc0 . containsKey ( arg1 ) ) loc0 . remove ( arg1 ) ; loc0 = getEdges ( arg1 ) ; if ( ! loc0 . isEmpty ( ) && loc0 . containsKey ( arg0 ) ) loc0 . remove ( arg0 ) ; }
elimina una aresta del graf concode_field_sep HashMap<K,HashMap<K,T>> edges concode_elem_sep ArrayList<K> vertexs concode_field_sep void removeVertex concode_elem_sep boolean equals concode_elem_sep Graph<K,T> clone concode_elem_sep void addEdgeUnidir concode_elem_sep HashMap<K,T> getEdges concode_elem_sep ArrayList<K> getVertexs concode_elem_sep HashMap<K,HashMap<K,T>> getEdgesFull concode_elem_sep void addVertex concode_elem_sep void addEdge concode_elem_sep T getEdge concode_elem_sep ArrayList<K> getNeighbors