Seems your'e trying to write a program rather than draw a flowchart. On Mon, March 26, 2007 5:19 pm, Kenny Graham wrote: >> I don't understand what you mean when you say this involves recursion. > > (a)<-+ > | | > (b) | > | | > (c)--+ > | > (d) > > If C takes the route back to A, the whole thing starts back over, so > you'd end up with infinitely nested lists. The only way I can think > of getting around that would be if there were an idref attribute to > embed list items, so you could have <li id="a"> at the top, and then > for C you'd have <li link="a">. That'd be.... fun. > > > ******************************************************************* > List Guidelines: http://webstandardsgroup.org/mail/guidelines.cfm > Unsubscribe: http://webstandardsgroup.org/join/unsubscribe.cfm > Help: [EMAIL PROTECTED] > ******************************************************************* > >
-- Stuart Foulstone. http://www.bigeasyweb.co.uk BigEasy Web Design 69 Flockton Court Rockingham Street Sheffield S1 4EB Tel. 07751 413451 ******************************************************************* List Guidelines: http://webstandardsgroup.org/mail/guidelines.cfm Unsubscribe: http://webstandardsgroup.org/join/unsubscribe.cfm Help: [EMAIL PROTECTED] *******************************************************************
