N function ( N arg0 ) { SPFnode < N , E > loc0 ; N loc1 = null ; while ( ( loc0 = spfnodes . get ( arg0 ) ) != null && loc0 . parents . size ( ) > 0 ) { loc1 = arg0 ; arg0 = loc0 . parents . getFirst ( ) . from ( ) ; } return loc1 ; }
return the next-hop node for the shortest path from the root node to the given node . concode_field_sep int cost concode_elem_sep PriorityQueue<SPFnode<N,E>> q concode_elem_sep Graph<N,E> g concode_elem_sep N root concode_elem_sep HashMap<N,SPFnode<N,E>> spfnodes concode_elem_sep N n concode_elem_sep LinkedList<Edge<N,L>> parents concode_field_sep List<Edge<N,E>> path concode_elem_sep void explore concode_elem_sep N root concode_elem_sep String toString concode_elem_sep void run concode_elem_sep int compareTo