Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #143315
| From | Mikko <mikko.levanto@iki.fi> |
|---|---|
| Newsgroups | comp.theory, sci.logic |
| Subject | Re: Happy Recovery |
| Followup-To | comp.theory |
| Date | 2026-08-16 10:29 +0300 |
| Organization | A noiseless patient Spider |
| Message-ID | <115rosh$bfi$1@dont-email.me> (permalink) |
| References | (4 earlier) <115cjhm$7pv1$1@solani.org> <bzIfS.688690$yWz9.359834@fx04.ams4> <115o0va$fqor$1@solani.org> <115p5pn$37f7k$1@dont-email.me> <115pes1$gmk0$1@solani.org> |
Cross-posted to 2 groups.
Followups directed to: comp.theory
On 15/08/2026 13:26, polcott wrote: > On 8/15/2026 2:51 AM, Mikko wrote: >> On 15/08/2026 00:22, polcott wrote: >>> On 8/14/2026 12:49 PM, Johann 'Myrkraverk' Oskarsson wrote: >>>> On 10/08/2026 9:26 PM, polcott wrote: >>>>> >>>>> If you understand what a directed acyclic graph >>>>> is then you will understand how you are wrong. >>>>> >>>> Since you have all the knowledge, why don't you teach us how you >>>> code directed acyclic graphs, in C? I mean, show code, and not >>>> just spout theoretical nonsense. You say you're already recovered, >>>> so this must be a simple task. >>>> >>>> Or at minimum, tell us exactly which graph library you'd use when >>>> coding >>>> graphs in C. >>>> >>>> >>>> Best wishes, and happy coding in C! >>> >>> I would make a rooted directed acyclic graph using >>> C++ std:vector with integer indices as the links >>> between the nodes. >>> >>> A small subset of C++ is enormously better than C. >>> I only use 2 or 3 std library functions and C++ >>> classes/objects. >>> >>> This last difference lets you divide up a a system >>> into totally independent modules such that changes >>> to one cannot possibly have any side-effects on and >>> of the others. It makes system development much easier >>> and much more reliable and has very little learning >>> curve. I make sure to totally ignore all of the rest >>> of C++. >> >> If you want a directed acyclic graphs as a datatype you must check >> every time the structure is updated that no cycle is produced. > > It is inherently a tree like structure that only > adds leaves. You just need be careful that the restrictions are fully implemented. -- Mikko
Back to comp.theory | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
In the hospital with pneumonia for three weeks recovering at home on oxygen olcott <polcott333@gmail.com> - 2026-08-08 10:30 -0500
Happy Recovery (was: Re: In the hospital with pneumonia for three weeks recovering at home on oxygen) Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-09 02:20 +0800
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-08 16:13 -0500
Re: Happy Recovery Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-10 05:40 +0800
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-09 18:07 -0500
Re: Happy Recovery "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2026-08-10 13:13 -0700
Re: Happy Recovery "Fred. Zwarts" <F.Zwarts@HetNet.nl> - 2026-08-10 08:31 +0200
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-10 08:26 -0500
Re: Happy Recovery Ross Finlayson <ross.a.finlayson@gmail.com> - 2026-08-10 07:02 -0700
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-10 10:20 -0500
Re: Happy Recovery Mikko <mikko.levanto@iki.fi> - 2026-08-11 11:22 +0300
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-11 07:35 -0500
Re: Happy Recovery Mikko <mikko.levanto@iki.fi> - 2026-08-12 11:46 +0300
Re: Happy Recovery olcott <polcott333@gmail.com> - 2026-08-12 08:36 -0500
Re: Happy Recovery Mikko <mikko.levanto@iki.fi> - 2026-08-13 10:07 +0300
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-13 04:05 -0500
Re: Happy Recovery Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-15 01:55 +0800
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-14 16:25 -0500
Re: Happy Recovery Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-15 01:49 +0800
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-14 16:22 -0500
Re: Happy Recovery Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-15 13:31 +0800
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-15 05:33 -0500
Re: Happy Recovery Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-15 19:26 +0800
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-15 08:32 -0500
Re: Happy Recovery Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-15 22:36 +0800
Re: Happy Recovery "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2026-08-15 12:33 -0700
Re: Happy Recovery Mikko <mikko.levanto@iki.fi> - 2026-08-15 10:51 +0300
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-15 05:26 -0500
Re: Happy Recovery Mikko <mikko.levanto@iki.fi> - 2026-08-16 10:29 +0300
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-16 07:34 -0500
Re: Happy Recovery Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-16 16:03 +0800
Re: Happy Recovery Alan Mackenzie <acm@muc.de> - 2026-08-16 12:52 +0000
Re: Happy Recovery Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-16 21:20 +0800
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-21 12:36 -0500
Re: Happy Recovery Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-22 02:17 +0800
Re: Happy Recovery olcott <polcott333@gmail.com> - 2026-08-21 15:02 -0500
Re: Happy Recovery Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-22 07:35 +0800
Re: Happy Recovery olcott <polcott333@gmail.com> - 2026-08-21 21:41 -0500
Re: Happy Recovery "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2026-08-10 13:12 -0700
csiph-web