Returns length of shortest chain to reach ' target ' from ' start ' using minimum number of adjacent moves . D is dictionary
function shortestChainLen ( start , target , D ) { if ( start == target ) return 0 ;