一、怎麼證明 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