算法第四版 - Java- Algorithms FOURTH EDITION - 斯坦福教授词汇表

faster effective complicated critical allow adj multiple msd task reachable prove fact describe con again mid know facing determine abstract specify property precisely natural machine fundamental design define better selection pair indexed common adjacency topological very library event considered component question prefix pat general extra down show found false why mathematical doing understand provide distinct collection build transaction huge height particle final factor draw web until per pass depth increment full sink push least answer likely thus instead com undirected built parent defined always work version computing language finding abstraction within context top represent expression read now dfa definition alphabet support useful growth without various suppose compute maximum information often max primitive difficult char bag practical larger entry longest print easy comparable network counter idea stream start bottom lists val several note long fundamentals give complete change total should refer merge done application statement negative function date minimum match end amount true rank position call approach trace shown searching log must main efficient constructor associated state solve else whether single job compare proportional delete result marked loop study reference best structure constant computer remove empty output corresponding analysis sum solution create quick like could ordered possible directed simple proof operation memory variable point typical take cycle numbers while sequence recursive space heap compression through representation process insertion small important make linked based line worst links union less black bit name may average about different large run weight basic programming known argument mst source file book times flow tick proposition equal