From: Ludovic Brenta <ludovic@ludovic-brenta.org>
Subject: Re: Topological Sort Help
Date: Mon, 05 Feb 2007 21:39:09 +0100
Date: 2007-02-05T21:39:09+01:00 [thread overview]
Message-ID: <87y7ncjq4y.fsf@ludovic-brenta.org> (raw)
In-Reply-To: 1170707421.136089.281290@l53g2000cwa.googlegroups.com
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.
next prev parent reply other threads:[~2007-02-05 20:39 UTC|newest]
Thread overview: 20+ messages / expand[flat|nested] mbox.gz Atom feed top
2007-02-04 19:54 Topological Sort Help isaac2004
2007-02-04 21:45 ` Ludovic Brenta
2007-02-05 20:30 ` isaac2004
2007-02-05 20:39 ` Ludovic Brenta [this message]
2007-02-06 2:18 ` isaac2004
2007-02-06 9:06 ` Ludovic Brenta
2007-02-08 1:19 ` isaac2004
2007-02-08 9:25 ` Ludovic Brenta
2007-02-08 18:14 ` isaac2004
2007-02-08 18:24 ` Ludovic Brenta
2007-02-08 18:29 ` isaac2004
2007-02-08 18:54 ` Ludovic Brenta
2007-02-08 19:14 ` isaac2004
2007-02-08 19:27 ` Ludovic Brenta
2007-02-08 20:22 ` isaac2004
2007-02-09 2:04 ` isaac2004
2007-02-08 18:38 ` Jeffrey R. Carter
2007-02-08 18:53 ` isaac2004
2007-02-09 4:57 ` Jeffrey R. Carter
2007-02-10 8:37 ` s053914
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox