[合集] 问个算法问题# Programming - 葵花宝典
c*d
1 楼
☆─────────────────────────────────────☆
mengt (tt) 于 (Thu Jan 11 15:14:15 2007) 提到:
一个fully connected graph, 有多少个不同的spanning tree?
☆─────────────────────────────────────☆
Pontiff (树) 于 (Thu Jan 11 15:17:42 2007) 提到:
suppose a graph with (n-1) vertice have f(n-1) spanning tree, then if we
increase vertice by one, we should have n*f(n-1) spanning trees.
so I think it's n!
一个fully connected graph, 有多少个不同的spanning tree?
☆─────────────────────────────────────☆
mengt (tt) 于 (Thu Jan 11
mengt (tt) 于 (Thu Jan 11 15:14:15 2007) 提到:
一个fully connected graph, 有多少个不同的spanning tree?
☆─────────────────────────────────────☆
Pontiff (树) 于 (Thu Jan 11 15:17:42 2007) 提到:
suppose a graph with (n-1) vertice have f(n-1) spanning tree, then if we
increase vertice by one, we should have n*f(n-1) spanning trees.
so I think it's n!
一个fully connected graph, 有多少个不同的spanning tree?
☆─────────────────────────────────────☆
mengt (tt) 于 (Thu Jan 11