| 单词 |
strongly connected digraph |
| 释义 |
strongly connected digraph strongly connected digraph[¦strȯŋ·lē kə¦nek·təd ′dī‚graf] (mathematics) A directed graph in which there is a directed path from every vertex to every other vertex. |
| 随便看 |
- krutilin, sergei
- krutilin, sergei andreevich
- krutinka
- krutoi
- krutov, larionov, makarov
- kruunenberg van der erve
- kruus, khans
- kruus, khans khansovich
- kruyshev
- kruzenshtern, ivan
- kruzenshtern, ivan fedorovich
- kruzenshtern strait
- kruzhilin, georgii nikitich
- kruzhka
- kruzhkha
- kruzhkov, vladimir
- kruzhkov, vladimir semenovich
- kruševac
- krušné hory
- krv
- krva
- krvba
- krvc
- krve
- krvf
|