void function ( K arg0 ) { if ( vertexs . contains ( arg0 ) ) return ; vertexs . add ( arg0 ) ; HashMap < K , T > loc0 = new HashMap < K , T > ( ) ; edges . put ( arg0 , loc0 ) ; }
afegim un vertex al graf concode_field_sep HashMap<K,HashMap<K,T>> edges concode_elem_sep ArrayList<K> vertexs concode_field_sep void removeEdge concode_elem_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 addEdge concode_elem_sep T getEdge concode_elem_sep ArrayList<K> getNeighbors