What is a spanning Tree?



What is a spanning Tree?..

Answer / jagrit kashyap

A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized.

Is This Answer Correct ?    1 Yes 0 No

Post New Answer

More C Interview Questions

can we have joblib in a proc ?

0 Answers  


in any language the sound structure of that language depends on its a) character set, input/output function, its control structures b) character set, library functions, input/output functions its control structures c) character set, library functions, control sturctures d) character set, operators, its control structures

0 Answers  


what is the difference between while and do while?

2 Answers  


What is the relation between # and include<stdio.h>

5 Answers   HCL,


Is there sort function in c?

0 Answers  






A c program to display count values from 0 to 100 and flash each digit for a secong.reset the counter after it reaches 100.use for loop,. pls guys hepl me.. :(

0 Answers  


Which one would you prefer - a macro or a function?

0 Answers  


What is s in c?

0 Answers  


We can draw a box in cprogram by using only one printf();& without using graphic.h header file?

4 Answers   NIIT,


#define MAX(x,y) (x) > (y) ? (x) : (y) main() { int i = 10, j = 5, k = 0; k = MAX(i++, ++j); printf("%d %d %d", i,j,k); } what will the values of i , j and k? }

14 Answers   CDAC, GATE, NDS, TCS,


How are variables declared in c?

0 Answers  


Why is it usually a bad idea to use gets()? Suggest a workaround.

1 Answers  


Categories