Hi I have the following little package that I use all the time.
It is called `graphsearch-support' and it just gives you a "decoupled way" to do graph searches, hence topological sorts. Essentially, every time you need to traverse a graph like structure I use these package instead of cluttering my data structures with the support for DFS and friends. Writing a topsort routine then just becomes an easier task. Hope it helps. Cheers -- Marco Antoniotti ======================================================== NYU Courant Bioinformatics Group tel. +1 - 212 - 998 3488 715 Broadway 10th Floor fax +1 - 212 - 995 4122 New York, NY 10003, USA http://bioinformatics.cat.nyu.edu "Hello New York! We'll do what we can!" Bill Murray in `Ghostbusters'. -- Binary/unsupported file stripped by Listar -- -- Type: application/x-gzip -- File: graphsearch.tgz
