A spanning tree in an connected, undirected graph is a subgraph that includes all vertices, is a tree and is connected.
Questions tagged [spanning-tree]
106 questions
0
votes
1 answer
STP - protocol id in bpdu
The STP BPDU begins with the protocol id field and the version id. I understand that the version is the type of the STP:
0 stands for STP,
2 for RSTP
and 3 for MSTP.
So what do we really need the protocol id field for? When will it not be 0?
Networking pup
- 65
- 1
- 7
0
votes
1 answer
Python basic spanning tree algorithm
I cannot figure out how to implement a basic spanning tree in Python; an un-weighted spanning tree.
I've learned how to implement an adjacency list:
for edge in adj1:
x, y = edge[int(0)], edge[int(1)]
if x not in adj2: adj2[x] = set()
if…
theGreatWhatever
- 33
- 2
- 10
0
votes
2 answers
Given a graph find a spanning tree which is not minimum
How to find a spanning tree which is not minimum in a graph(if possiblr)
Depinder Preet Singh
- 33
- 5
0
votes
0 answers
Minimum to Maximum Connectivity Network
There is a computer network with N nodes and N-1 connection link. Each connection link has a time associated with it.
We are given a initial network setup As shown in the figure. Computers are connected with two way links.
Network time is…
Kaushalendra Mishra
- 96
- 7
0
votes
1 answer
Polynomial Time Reduction Gadget that runs in poly time but creates n! size output.
Say someone has found a way to create a graph given a CNF boolean expression in O(n^3) time, and that any spanning tree of this special graph will be a solution to the CNF equation.
The scenario seems to be hinting that the someone has found a…
user1718682
- 71
- 1
- 8
0
votes
0 answers
Spanning tree with exactly a1+a2=n edges
This question is very similar to this one: spanning tree with exactly k colored edges
It's not the same question! - As you can see the answer of the question above is not the same (to my Q)....
We have a connected, undirected graph G=(V,E) with…
Yang
- 1
- 5
0
votes
1 answer
Shortest path of two vertices in spanning tree with edges all the same distance
I have a spanning tree of a graph, starting from a vertex v. All the edges are the same distance (Let's say 1).
How can I work out what the shortest path from v to another vertex u?
user2397282
- 3,798
- 15
- 48
- 94
0
votes
2 answers
Spanning tree DFS algorithm doesn't create a tree
I wrote this pseudocode to create a spanning tree from a non oriented graph (G,V), where S is a stack and v is the vertex from which we want to start the computation:
PROCEDURE SPANNING-TREE(G,v)
S := {v}
while S is not empty
…
Ramy Al Zuhouri
- 21,580
- 26
- 105
- 187
0
votes
2 answers
Best algorithm to find shortest path in a spanning tree from single source to all other nodes
How can I find the shortest path from every vertex to every vertex if I know that the given graph is actually a spanning tree i.e. each pair of vertices have only one path between them?
I want the most optimal solution. I know the Dijkstra's…
user3903448
- 320
- 1
- 8
0
votes
1 answer
Given a graph G with unique edge weights, are all max spanning trees of G a max bottleneck tree?
The full version of this question is quoted below:
Let G be a connected graph with n vertices, m edges with distinct edge
weights. Let T be a tree of G with n vertices and n-1 edges (i.e. a
spanning tree), and define a bottleneck edge of T to…
Ray
- 3
- 1
0
votes
3 answers
Minimum cost broadcast routing
Is there any method where we can get a minimum cost broadcast routing scheme without using the spanning tree algorithm?
Any references to guide me on this will be of great use to me.
Chaitanya
- 1,698
- 5
- 21
- 41
0
votes
1 answer
How Spanning Tree Protocol Provides Redundancy in path in L2 Layer?
I have very basic question related to Spanning Tree Protocol how it provides Redundancy in path this is something I read somewhere about STP but what I believe is it disable Network Redundancy .
Whats is your view Guys?
"Note sure this question…
Amit Singh Tomar
- 8,380
- 27
- 120
- 199
0
votes
2 answers
Cisco - quickest way to achieve STP convergence after link failure
I am configuring a pair of switches, one each for our two datacentres. We have a pair of links between the sites, one a dedicated private fibre, the other a backup 100Mbps connection. For reasons not worth going into, I need to push a number of…
btongeorge
- 421
- 2
- 12
- 23
-1
votes
2 answers
Linear Time Algorithm to Find MST?
Given 2 Algorithms for a graph G=(V,E):
One:
Sort edges from lowest to highest weight.
Set T = {}
for each edge e in the previous order, check if e Union T doesn't have any cycles.
If yes, Add e to T.
Return T if it's a spanning Tree.
Two:
Sort…
LOG
- 45
- 6
-1
votes
1 answer
How does Uplink fast improve the Spanning Tree Protocol?
What improvement to the Spanning Tree protocol is provided by the “Uplink Fast”
solution?
blazing
- 557
- 2
- 4
- 20