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=ham autolearn_force=no version=3.4.4 X-Google-Thread: 103376,cd5005cccfba0311 X-Google-Attributes: gid103376,public X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news2.google.com!postnews.google.com!k78g2000cwa.googlegroups.com!not-for-mail From: "isaac2004" Newsgroups: comp.lang.ada Subject: Re: Topological Sort Help Date: 5 Feb 2007 18:18:14 -0800 Organization: http://groups.google.com Message-ID: <1170728294.194370.133540@k78g2000cwa.googlegroups.com> References: <1170618852.885855.258390@j27g2000cwj.googlegroups.com> <87sldllhpt.fsf@ludovic-brenta.org> <1170707421.136089.281290@l53g2000cwa.googlegroups.com> <87y7ncjq4y.fsf@ludovic-brenta.org> NNTP-Posting-Host: 71.231.37.231 Mime-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" X-Trace: posting.google.com 1170728309 1624 127.0.0.1 (6 Feb 2007 02:18:29 GMT) X-Complaints-To: groups-abuse@google.com NNTP-Posting-Date: Tue, 6 Feb 2007 02:18:29 +0000 (UTC) In-Reply-To: <87y7ncjq4y.fsf@ludovic-brenta.org> User-Agent: G2/1.0 X-HTTP-UserAgent: Mozilla/4.0 (compatible; MSIE 7.0; Windows NT 6.0; SV1; SLCC1; .NET CLR 2.0.50727; .NET CLR 3.0.04506),gzip(gfe),gzip(gfe) Complaints-To: groups-abuse@google.com Injection-Info: k78g2000cwa.googlegroups.com; posting-host=71.231.37.231; posting-account=bWy1LAwAAAAtVkasDCH0ykMCBMNd-FcL Xref: g2news2.google.com comp.lang.ada:8997 Date: 2007-02-05T18:18:14-08:00 List-Id: "fpund online" is right i know the basics of how it works but implementing anything into it is the part im getting stuck at. any help On Feb 5, 12:39 pm, Ludovic Brenta wrote: > isaac2004 writes: > > well i have this data structure i found online that builds a matrix > > from a input file and then creates a graph from the matrix. my goal is > > to add and delete edges from this structure, that way i can use the > > top search to just direct pointers. here is the algorithm for the > > matrix and graph builder > > The matrix you "found online" is exactly the naive representation that > I described. Knowing that it should be easy for you to understand how > to add or remove edges, yes? > > -- > Ludovic Brenta.