question here because I'm concerned
with large sparsely connected graphs.
Any help is appreciated.
- Tiemo.
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clojure@googlegroups.com
Note that posts fr
That is really nice thank you. I'd have to take a real hard look at
it, to see whether or not it's the exact algorithm I need, but
nonetheless, you pointed me in the right direction. The code I
produced was a mess of mutable state and loops. Thank you very much!
On Nov 16, 6:29 pm, Ken Wesson wro
This is also a nice idea. I will take a look at both implementations.
On Nov 16, 8:16 pm, Mark Engelberg wrote:
> I think the simplest and most efficient way to simulate the random
> connection process in a functional manner is to start by generating a
> shuffled list of d copies of each vertices
doing this. Below
is a diagram of how it should look.
| 1 | 2 | 3 |
1 | 0 | A | B |
2 | A | 0 | C |
3 | B | C | 0 |
The 0's on the diagonal just mean that the diagonal is ignored, A, B and C are
ref's.
- Tiemo
nd inefficient, and I'm wondering whether it can be done more efficiently.
As for performance, I don't actually intend do do any matrix operations on it,
just lookups.
- Tiemo.
--
You received this message because you are subscribed to the Google
Groups "Clojure" group
