One can use Kirchof's theorem to get distinct minimum spanning trees .....

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+25 votes

+38 votes

0

Sir,could you explain? actually i want to know if there is any shortcut for finding total number of minimum spanning trees of a Graph.

The steps i have taken to answer this question

1.I used krushkal's algorithm for finding all the minimum spanning trees.

2..Then i counted all the total no of minimum spanning trees.

But that is a lengthy process & takes some time..So i want to know.. is there any other method for fining it easily? Waiting for your Reply :)

The steps i have taken to answer this question

1.I used krushkal's algorithm for finding all the minimum spanning trees.

2..Then i counted all the total no of minimum spanning trees.

But that is a lengthy process & takes some time..So i want to know.. is there any other method for fining it easily? Waiting for your Reply :)

- All categories
- General Aptitude 1.6k
- Engineering Mathematics 7.5k
- Digital Logic 3k
- Programming & DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6k
- Compiler Design 2.1k
- Databases 4.2k
- CO & Architecture 3.5k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.5k
- Admissions 586
- Exam Queries 572
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,129 questions

53,252 answers

184,785 comments

70,506 users