Path: news.daimi.aau.dk!news.uni-c.dk!sunic!sunic.sunet.se!seunet!news2.swip.net!plug.news.pipex.net!pipex!oleane!jussieu.fr!univ-lyon1.fr!news From: "Maciej J. Macowicz" Newsgroups: comp.lang.beta Subject: Graph library for Beta Date: 2 Jun 1995 10:31:08 GMT Organization: C.I.S.M. Universite de Lyon 1 / INSA de Lyon Lines: 37 Message-ID: <3qmp9c$620@cismsun.univ-lyon1.fr> NNTP-Posting-Host: cpe.ipl.fr Hi, Beta people, I am currenty working on graph library in Beta. I would like to ask if someone has developped something 'like' such a library ? By the way, if someone is interested in my library - let me know, I will put it in ftp area (when I will finish some 'basic' documentation = +- the end of June). My library includes (for the moment) few algorithms : 1. bfs/dfs with numbering of nodes 2. shortest paths (Dijkstra/Bellman-Ford) 3. longest --"-- 3. reliability max in a network 4. speed max in a network, and is "relatively" performant : On PC/Linux 486 DX2 50 with 8MB RAM, the shortest path from a choosen node to all other for a complete graph containing 600 nodes takes about 6 seconds :-). Cheers - Maciej. -------------------------------------------------------------------------- Maciej J. Macowicz LISA, ICPI-CPE- Lyon E-mail: mm@mars.ipl.fr Home Page: http://www.ipl.fr/~mm S-Mail: LISA-ICPI-CPE, 31 place Bellecour, F69288 Lyon Cedex 02, France Phone: 72 32 50 63 Fax: 72 32 51 48 --------------------------------------------------------------------------