Set < Edge > function ( Node arg0 ) { Set < Edge > loc0 = new HashSet < Edge > ( ) ; for ( Edge loc1 : this . _edges ) { if ( ( loc1 . getFrom ( ) == arg0 ) || ( loc1 . getTo ( ) == arg0 ) ) { loc0 . add ( loc1 ) ; } } return loc0 ; }
find all edges that are connected to the specific node , both as an outgoing edge #getfrom or incoming edge #getto end point . concode_field_sep Set<Node> _nodes concode_elem_sep Set<Edge> _edges concode_field_sep void setNodes concode_elem_sep void addNode concode_elem_sep Set<Node> getNodes concode_elem_sep void insertNode concode_elem_sep void insertNode concode_elem_sep Path breadthFirst concode_elem_sep Node getNodeByName concode_elem_sep void removeEdge concode_elem_sep void removeEdge concode_elem_sep Set<Edge> findEdgesFrom concode_elem_sep Path getPath concode_elem_sep Path getPath concode_elem_sep Set<Edge> getEdges concode_elem_sep void addEdge concode_elem_sep void addEdge concode_elem_sep void addEdge concode_elem_sep void removeNode concode_elem_sep void setEdges