An undirected connected graph with no cycles is called a tree. A vertex with degree equal to one in a tree is called a leaf.

 
  • 一個(gè)無(wú)環(huán)無(wú)向連通圖稱(chēng)為一棵樹(shù)。樹(shù)中一個(gè)度為一的點(diǎn)稱(chēng)為葉子結點(diǎn)。
今日熱詞
目錄 附錄 查詞歷史
国内精品美女A∨在线播放xuan