Node function ( int arg0 ) { return nodes . get ( arg0 ) ; }
get node at the specified position in the list . the order is the same in which the nodes were entered . concode_field_sep Node finalNode concode_elem_sep ArrayList<Node> nodes concode_elem_sep Iterator<Node> nodeIterator concode_elem_sep Iterator<Edge> edgeIterator concode_elem_sep Node initialNode concode_elem_sep ArrayList<Edge> edges concode_field_sep boolean isNodeInGraph concode_elem_sep void addNode concode_elem_sep boolean hasMoreEdges concode_elem_sep boolean hasMoreNodes concode_elem_sep Node getInitialNode concode_elem_sep boolean isInitialNode concode_elem_sep boolean isFinalNode concode_elem_sep void startEdgeIterator concode_elem_sep Edge linkNodes concode_elem_sep Edge nextEdge concode_elem_sep void startNodeIterator concode_elem_sep Node[] nodeToArray concode_elem_sep void printGraph concode_elem_sep void copyGraph concode_elem_sep void insertGraph concode_elem_sep int size concode_elem_sep Node getFinalNode concode_elem_sep Node nextNode concode_elem_sep void setInitialNode concode_elem_sep boolean isEdgeInGraph concode_elem_sep int indexOf concode_elem_sep void setFinalNode concode_elem_sep void addEdge concode_elem_sep boolean validate