w***s
发帖数: 61 | 1 【 以下文字转载自 Programming 讨论区,原文如下 】
发信人: emcc (Tarzan), 信区: Programming
标 题: Help: O(|E|) algorithm for Minimal Spanning Tree
发信站: The unknown SPACE (Mon Sep 4 08:46:31 2000) WWW-POST
Given a graph G=(E,V), and edge e in G, find a O(|E|)
algorithm
to test whether e is contained in some of G's Minimal
Spanning
Tree.
Thanks in advance. |
|
