oren tal Posted April 30, 2007 Share Posted April 30, 2007 I need help in design algoritem that check for a given Graph if a minimal spanning tree exist without a specific edge. Mean that for the original graph you find a minimal spannig tree and that spanning tree not include the edge and it is minimal spanning tree of the graph that do include the edge. The algorithm must run in O(|V| + |E|) when V - vertics and E - edge Thank for any help! Link to comment Share on other sites More sharing options...
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now