> < ^ Date: Mon, 10 May 1999 12:31:24 -0400 (EDT)
> < ^ From: Drew Krause <drkrause@mindspring.com >
^ Subject: eulerian path algorithm

Apologies for the earlier post; 'CollapsedAdjacencyMat(g)' will give an
adjacency matrix, as I discovered.

Another question: has anyone developed a 'grape' algorithm for
discovering a graph's Eulerian path, if it exists? 

////////////////////////////////
Drew Krause           Miami, FL      
     dkrause@netside.net    
\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\

Miles-Receive-Header: reply

> < [top]