[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Fwd: Adjacency Matrix Library Project for Google Summer of Code
From: |
fgnievinski |
Subject: |
Re: Fwd: Adjacency Matrix Library Project for Google Summer of Code |
Date: |
Tue, 4 Mar 2014 21:20:57 -0800 (PST) |
David Spies wrote
> ---------- Forwarded message ----------
> From: David Spies <
> dspies@
> >
> Date: Tue, Mar 4, 2014 at 1:38 PM
> Subject: Re: Adjacency Matrix Library Project for Google Summer of Code
> To: Jordi GutiƩrrez Hermoso <
> jordigh@
> >
> ...
>
> I think with adding some minor generalizations of the matrix-multiply
> operation, Octave can be a very good tool for performing a BFS.
If I were you, I'd implement a new class using Octave's scripting language,
then overload the necessary operators, and implement only the bottleneck
functions in C/C++ MEX.
-F.
--
View this message in context:
http://octave.1599824.n4.nabble.com/Adjacency-Matrix-Library-Project-for-Google-Summer-of-Code-tp4662607p4662721.html
Sent from the Octave - Maintainers mailing list archive at Nabble.com.