作者assassin88 (...)
看板Grad-ProbAsk
标题[理工] [algo]-图形演算法
时间Wed Dec 23 22:29:05 2009
一、怎麽证明 kruskal's algo. 是正确的？
二、The incidence matrix of a directed graph G=(V,E) is a |V|*|E| matrix
B=(bij) such that
{ -1, if edge j leaves vertex i
bij={ 1, if edge j enters vertex i
{ 0, otherwise
Let matrix C=BB^T. Describe what the entries of the matrix C represent.
感谢...
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 61.57.78.159