Question
Define ‘minimum cost spanning method’.

Answers

Let G=(V,E) be an undirected connected graph. A sub-graph t =(V, E’) of G is a spanning tree of G if and only if t is a tree.
To find out minimum cost spanning method we have following method’s;
Prim’s Algorithm : O(n*n)
Kruskal’s Algorithm : O(e loge)   Your Comment






Search
Can you Answer!!
  • Q What is the use of user account control (uac)?
  • Q Which state is east of Delhi?
  • Q The first to get Saraswati Samman:
  • Q What are the functions of a teradata dba?
  • Q What are the main components of the compensation management?
  • Q Give a comparative account on the heart of invertebrates and chordates and highlight the phylogeny.
  • Q List some factors for performance tuning in data services?
  • Q Explain the contents that are a part of dclgen?
  • Q Who inaugurates Delhi Metro's Magenta line? A. Venkaiyah Naidu B. Ram Nath Kovind C. Narendra Modi D. Jitendra Singh
  • Q What is the brand name for metoclopramide?
  • Q Loader and linker