Maths&physics
Badges: 15
Rep:
?
#1
Report Thread starter 1 year ago
#1
how do I do d? can someone explain how and why please? thanks
Attached files
0
reply
Maths&physics
Badges: 15
Rep:
?
#2
Report Thread starter 1 year ago
#2
bump
0
reply
tiny hobbit
Badges: 15
Rep:
?
#3
Report 1 year ago
#3
(Original post by Maths&physics)
how do I do d? can someone explain how and why please? thanks
since DI and HG are not adjacent edges, you can't use Prim's Algorithm, since the tree in Prim's algorithm is always connected as it grows.

So use Kruskal's algorithm taking DI and HG as your first two edges and then looking for the shortest edge which does not make a cycle, etc.

(and I'm working my way through your June 2010 paper).
0
reply
Maths&physics
Badges: 15
Rep:
?
#4
Report Thread starter 1 year ago
#4
(Original post by tiny hobbit)
since DI and HG are not adjacent edges, you can't use Prim's Algorithm, since the tree in Prim's algorithm is always connected as it grows.

So use Kruskal's algorithm taking DI and HG as your first two edges and then looking for the shortest edge which does not make a cycle, etc.

(and I'm working my way through your June 2010 paper).
thank you
0
reply
X

Quick Reply

Attached files
Write a reply...
Reply
new posts
Back
to top
Latest
My Feed

See more of what you like on
The Student Room

You can personalise what you see on TSR. Tell us a little about yourself to get started.

Personalise

University open days

  • Sheffield Hallam University
    Get into Teaching in South Yorkshire Undergraduate
    Wed, 26 Feb '20
  • The University of Law
    Solicitor Series: Assessing Trainee Skills – LPC, GDL and MA Law - London Moorgate campus Postgraduate
    Wed, 26 Feb '20
  • University of East Anglia
    PGCE Open day Postgraduate
    Sat, 29 Feb '20

People at uni: do initiations (like heavy drinking) put you off joining sports societies?

Yes (533)
66.54%
No (268)
33.46%

Watched Threads

View All