Marko Kobal <marko.ko...@arctur.si> wrote on 09/10/2012 09:48:16 AM:
>
> Does anybody know if there is already an x10 implementation for
> searching the minimum spanning tree in a connected, (un)directed graph?
>
> If not, what would be the best way to get started with (for big trees
> that does not fit in a single node) in x10? Make use of distributed
> arrays? What algorithm would one use as a basis (sequential, parallel,
MSF)?
>
I don't know if this particular algorithm has been implemented yet, but I'd
suggest taking a look at ScaleGraph (http://www.scalegraph.org). They
released the first version of their distributed graph library written in
X10 last month.
--dave
------------------------------------------------------------------------------
Live Security Virtual Conference
Exclusive live event will cover all the ways today's security and
threat landscape has changed and how IT managers can respond. Discussions
will include endpoint security, mobile security and the latest in malware
threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/
_______________________________________________
X10-users mailing list
X10-users@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/x10-users
