Spanning Tree Protocol
How to get switch MAC address while implementing spanning tree protocol? ...
spanning-tree
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. ...
Cheapest Spanning Transitive Closure in Directed Graph
Hi, Given some positive-weighted directed graph, I'd like to find a cheapest set of edges s.t. 1. The set of vertices is a spanning tree, i.e. all vertices are present in the final graph 2. Every vertex is reachable from any other vertex through a directed path (transitive closure??) 3. Set of edges has the minimum cost Essentially, I ...
Concern about connected graph with directed edges
Can anyone advice me how to find a minimum degree (outgoing) to construct connected graph with directed edges by given number of vertex N? (also appreciate any related website that can help me to understand how to calculate this) ...
balancing a spanning tree of a growing undirected graph
I am looking for ways to maintain a relatively balanced spanning tree of a graph, as I add new nodes/edges to the graph. I have an undirected graph that starts as a single node, the "root". At each step, I add to the graph either a "cross edge" or a "parent-child edge". Cross edges introduce no new nodes; they just connect two existin...
set of all spanning trees
I want to generate the set of spanning trees of an undirected graph such that each edge appears in at least one spanning tree. Can someone suggest me an algorithm for doing this, or if there is a usable code for this, that will be even better. Thanks. ...