Re: How to judge if the graph is cyclic when add a new edge?
- From: Googmeister <googmeister@xxxxxxxxx>
- Date: 28 Apr 2007 07:46:40 -0700
On Apr 26, 4:34 am, "cstnt" <c...@xxxxxxxxxxx> wrote:
How to judge if the graph is cyclic when add a new edge? How to do it
quickly.
Assuming your graph is undirected, the standard approach
is to use the "union-find" (a.k.a. "disjoint-sets") data structure.
The time per edge insetion / will edge add a cycle is
essentially constant.
.
- References:
- Prev by Date: Re: random integer
- Next by Date: Re: Applications that use thousands of data containers?
- Previous by thread: Re: How to judge if the graph is cyclic when add a new edge?
- Next by thread: CfP: 7th Domain-Specific Modeling workshop at OOPSLA
- Index(es):
