| 单词 | strongly connected digraph | 
	
		| 释义 | strongly connected digraphstrongly 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. | 
	
		| 随便看 | 
kostiuk, grigorii silovichkostiukovichikostiukovkakostiuk, platonkostiuk, platon grigorevichkostiushko-valiuzhanich, antonkostiushko-valiuzhanich, anton antonovichkostka napierski rebellion of 1651kostmann agranulocytosiskostmann diseasekostmann, rolfkostmann's neutropeniakostmann's syndromekostmann syndromekostof, spirokostomarov, nikolaikostomarov, nikolai ivanovichkostopolkostousov, anatoliikostousov, anatolii ivanovichkostov, doncho stoianovkostovich, ogneslavkostovich, ogneslav stepanovichkostov, ivan nikolovkostov, stefan lazarov |