From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-0.8 required=5.0 tests=BAYES_00,INVALID_MSGID,
	SUBJ_ALL_CAPS autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,4c1bae98fba6f218,start
X-Google-Attributes: gid103376,public
From: magallan@engr.csulb.edu (Roberto Magallanes)
Subject: EULER'S CYCLE
Date: 1996/11/30
Message-ID: <57nvve$1ni@hatathli.csulb.edu>#1/1
X-Deja-AN: 201481598
organization: Cal State Long Beach
newsgroups: comp.lang.ada
Date: 1996-11-30T00:00:00+00:00
List-Id: <comp.lang.ada>



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.