* EULER'S CYCLE
@ 1996-11-30 0:00 Roberto Magallanes
0 siblings, 0 replies; only message in thread
From: Roberto Magallanes @ 1996-11-30 0:00 UTC (permalink / raw)
Can anyone help me with a program to implement Euler's cycle? The part
that's giving me the most trouble is keeping track of the path. How can I
do this using an adjacency matrix? Would it be a little easier to use an
adjacency list? This shouldn't be too tough of a program, but since I
haven't done any programming in quite a while I forgot a lot. ANY help
would be greatly appreciated.
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~1996-11-30 0:00 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
1996-11-30 0:00 EULER'S CYCLE Roberto Magallanes
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox