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=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM autolearn=unavailable autolearn_force=no version=3.4.4 Path: border1.nntp.ams3.giganews.com!border1.nntp.ams2.giganews.com!border2.nntp.ams2.giganews.com!border4.nntp.ams.giganews.com!border2.nntp.ams.giganews.com!nntp.giganews.com!feeder.erje.net!eu.feeder.erje.net!news.stack.nl!aioe.org!.POSTED!not-for-mail From: =?utf-8?Q?Yannick_Duch=C3=AAne_=28Hibou57?= =?utf-8?Q?=29?= Newsgroups: comp.lang.ada Subject: Re: Ada & Ontology ( OWL,RDF, JSON, dot) Date: Fri, 19 Jul 2013 23:17:29 +0200 Organization: Ada @ Home Message-ID: References: NNTP-Posting-Host: cJily9RRGDkFRIATpG/lqA.user.speranza.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed; delsp=yes Content-Transfer-Encoding: Quoted-Printable X-Complaints-To: abuse@aioe.org User-Agent: Opera Mail/12.16 (Linux) X-Notice: Filtered by postfilter v. 0.8.2 X-Original-Bytes: 1813 Xref: number.nntp.dca.giganews.com comp.lang.ada:182595 Date: 2013-07-19T23:17:29+02:00 List-Id: Le Tue, 16 Jul 2013 02:35:16 +0200, Randy Brukardt = a =C3=A9crit: > "Dmitry A. Kazakov" wrote in message > news:pgggo3irufxz$.mbvohwd9o6qd.dlg@40tude.net... >> On Sun, 14 Jul 2013 23:36:22 -0700 (PDT), Peter Brooks wrote: >> >>> Alternatively, is there a good Ada package for handling directed = >>> graphs? >> >> Well, it is difficult to provide a universal implementation of graphs= . >> Usually, you would needs a custom implementation. > > Right. If your graph doesn't have any cycles (that is, it's a tree),[=E2= =80=A6] I believe this was an oops: an acyclic graph is not necessarily a tree. -- = =E2=80=9CSyntactic sugar causes cancer of the semi-colons.=E2=80=9D [1] =E2=80=9CStructured Programming supports the law of the excluded muddle.= =E2=80=9D [1] [1]: Epigrams on Programming =E2=80=94 Alan J. =E2=80=94 P. Yale Univers= ity