LS uses Dijkstra’s algorithm to compute the shortest paths.
举一反三
- Dijkstra algorithm compute shortest path using weight on each communication-line.
- Finland’s students have the shortest school days and the shortest school years in the entire world.
- 定义函数如下：def compute(*numbers): s = 1 for n in numbers: s = s * n + n return s以下哪些选项的输入可以得到21的结果？ A: compute([3, 3]) B: nums = [1, 2, 3]; compute(nums) C: compute([3, 2, 1]) D: nums = (3, 3); compute(*nums)
- 列出当前工作目录下所有名称是 “s” 开头的文件的命令（） A: ls -ltR s* B: ls -ltr s* C: ls -ltr *s D: ls -lt s*
- Mary is ________ girl in her class. A: the second shortest B: a second shortest C: second shortest D: two shortest