Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Write Prim's Algorithm.
Ans: Prim's algorithm to find out a minimum spanning tree from a weighted graph in step by step form is given below.
Let G = (V, E) be graph and S = (VS, ES) be the spanning tree to be found from G.
Step 1: Choose a vertex v1 of V and initialize
VS = {v1} and
ES
= {}
Step 2: Choose a nearest neighbor of vi from V that is adjacent to some vj∈VS and that edge (vi, vj) does not form a cycle with members edge of ES. Set
VS = VS ∪{vi} and
ES = ES ∪{(vi, vj)}
Step 3: Again Repeat step2 until |Es| = |V| - 1.
(2a+8b)
why we use decision making using minimization of regret method in uncertainty?
log6+log-4
which laws of physics are used to discuss heat loss in a pipe
tan45 degrees=tan(90degrees-45degrees)
A firm is manufacturing 45,000 units of nuts. The probability of having a defective nut is 0.15 Compute the given i. The expected no. of defective nuts ii. The standard an
Pai is rational or irrational
y=3x^2+12+11
tan 2x = 1
I need to graph rational numbers on the number line Point A-.60, point B-1/4, point C-.4,point D-7/8
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd