0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
What are the five phases of the sdlc?
what are the phases of the sdlc
What is as sentence for phases?
The moon has different phases that it passes through, just like we have different phases in our lifetimes.
The different shapes of the moon seen from earth are called?
Moon Phases , or Lunar Phases.
How many faces does the moon have?
Phases* 8 Phases
What are four phases of mithosis?
Where are the four phases of motosis
What is spanning tree in data structure?
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.
Can dijkstra's algorithm produce a spanning tree?
yes, but a shortest path tree, not a minimum spanning tree
How can you find minimum spanning trees?
with minimum spanning tree algorthim
What effect will the command spanning-tree link-type point-to-point have on a rapid spanning tree port?
The port will rapidly transition to forwarding.
What is a characteristic of Spanning Tree Protocol?
A spanning tree protocol, or STP, is characteristic to a LAN. It provides a loop-free topology for networks within the system.
What is Difference between tree and spanning tree?
A tree is a connected graph in which only 1 path exist between any two vertices of the graph i.e. if the graph has no cycles. A spanning tree of a connected graph G is a tree which includes all the vertices of the graph G.There can be more than one spanning tree for a connected graph G.
Applications of minimum cost spanning tree?
Minimum cost spanning tree is used for Network designing.(like telephone, electrical, hydraulic, TV cable, computer, road)
Prove that a graph G is connected if and only if it has a spanning tree?
Proving this is simple. First, you prove that G has a spanning tree, it is connected, which is pretty obvious - a spanning tree itself is already a connected graph on the vertex set V(G), thus G which contains it as a spanning sub graph is obviously also connected. Second, you prove that if G is connected, it has a spanning tree. If G is a tree itself, then it must "contain" a spanning tree. If G is connected and not a tree, then it must have at least one cycle. I don't know if you know this or not, but there is a theorem stating that an edge is a cut-edge if and only if it is on no cycle (a cut-edge is an edge such that if you take it out, the graph becomes disconnected). Thus, you can just keep taking out edges from cycles in G until all that is left are cut-gees. Since you did not take out any cut-edges, the graph is still connected; since all that is left are cut-edges, there are no cycles. A connected graph with no cycles is a tree. Thus, G contains a spanning tree. Therefore, a graph G is connected if and only if it has a spanning tree!
Prove that a graph G is connected and only if it has a spanning tree?
Proving this is simple. First, you prove that G has a spanning tree, it is connected, which is pretty obvious - a spanning tree itself is already a connected graph on the vertex set V(G), thus G which contains it as a spanning sub graph is obviously also connected. Second, you prove that if G is connected, it has a spanning tree. If G is a tree itself, then it must "contain" a spanning tree. If G is connected and not a tree, then it must have at least one cycle. I don't know if you know this or not, but there is a theorem stating that an edge is a cut-edge if and only if it is on no cycle (a cut-edge is an edge such that if you take it out, the graph becomes disconnected). Thus, you can just keep taking out edges from cycles in G until all that is left are cut-gees. Since you did not take out any cut-edges, the graph is still connected; since all that is left are cut-edges, there are no cycles. A connected graph with no cycles is a tree. Thus, G contains a spanning tree. Therefore, a graph G is connected if and only if it has a spanning tree!
Which protocol prevent forwarding loops?
Spanning-Tree Protocol (STP)
What must a switch running spanning tree do when it is first turned on?
NOPE
What do you use To eliminate the possibility of a broadcast storm?
STP (Spanning Tree Protocol)
