Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re: In search of an algorithm for loading cyclic graphs

by exussum0 (Vicar)
on May 17, 2005 at 18:57 UTC ( #457946=note: print w/replies, xml ) Need Help??


in reply to In search of an algorithm for loading cyclic graphs

Kruskal, Prim.. there are many spanning tree algorithms. Create a spanning tree that is directed from one point and ends at another. Any edge you add will create a cycle. Make your DB follow that.

----
Give me strength for today.. I will not talk it away..
Just for a moment.. It will burn through the clouds.. and shine down on me.

  • Comment on Re: In search of an algorithm for loading cyclic graphs

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://457946]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (4)
As of 2023-02-05 20:48 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I prefer not to run the latest version of Perl because:







    Results (32 votes). Check out past polls.

    Notices?