Jump to content

Minimal spanning tree

oren tal
in Homework Help

Featured Replies

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!

Archived

This topic is now archived and is closed to further replies.

Go to topic listing

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.

Configure browser push notifications
Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.