Number of edges
int l = ( int ) Math . pow ( k , n ) ; for ( int i = 0 ; i < l ; ++ i ) S += A . charAt ( edges . get ( i ) ) ; S += startingNode ; return S ; } private static String string ( int n , char charAt ) { String str = " " ; for ( int i = 0 ; i < n ; i ++ ) str += charAt ; return str ; }