Newsgroups: comp.lang.prolog
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel!news.mathworks.com!uunet!newsflash.concordia.ca!nstn.ns.ca!dragon.acadiau.ca!dragon.acadiau.ca!900008m
From: 900008m@dragon.acadiau.ca (Bryan Manson)
Subject: Digraphs
Message-ID: <1995Mar13.213913.8070@relay.acadiau.ca>
Sender: news@relay.acadiau.ca
Nntp-Posting-Host: dragon.acadiau.ca
Organization: Acadia University
Date: Mon, 13 Mar 1995 21:39:13 GMT
Lines: 8

I'm looking for some code that will traverse a directed graph and find the
maximum (total) of the edges.

Any ideas would be greatly appreciated.

Thanks in advance


