<html>
<head>
<meta content="text/html; charset=ISO-8859-1"
http-equiv="Content-Type">
</head>
<body bgcolor="#FFFFFF" text="#3333FF">
I would suggest using the eigen library, Rccp has an interface to
this. Alternately, you could link to the boost graph library.<br>
<br>
+glenn<br>
<br>
On 06/24/2012 06:12 PM, Søren Højsgaard wrote:
<blockquote
cite="mid:7E8037094A0C2146AA3E6F94DAE621C307DAF87C@AD-EXCHMBX2-1.aau.dk"
type="cite">
<pre wrap="">Dear list
I have code for graph operations where I represent graphs as adjacency matrices (matrices with 0's and 1's). When graphs grow large storing all the 0's becomes uneconomical, so I want to use sparse matrices (from the Matrix package) for large graphs instead. Simple indexing operations like M[i,j] however are very slow, so I wonder if there are ways of dealing with sparse matrices (and rapid indexing) in the Rcpp framework. Apologies if I have overlooked posts on this topic.
Regards
Søren
_______________________________________________
Rcpp-devel mailing list
<a class="moz-txt-link-abbreviated" href="mailto:Rcpp-devel@lists.r-forge.r-project.org">Rcpp-devel@lists.r-forge.r-project.org</a>
<a class="moz-txt-link-freetext" href="https://lists.r-forge.r-project.org/cgi-bin/mailman/listinfo/rcpp-devel">https://lists.r-forge.r-project.org/cgi-bin/mailman/listinfo/rcpp-devel</a>
</pre>
</blockquote>
<br>
<pre class="moz-signature" cols="66">--
-----------------------------------
It is difficult to find a black cat in a dark room,
especially if there is no cat.
-- Chinese proverb
Dr. Glenn Lawyer
+352 661 967 244
Max-Planck-Institut für Informatik
Computational Biology and Applied Algorithmics
Campus E1 4
66123 Saarbrücken, Germany
<a class="moz-txt-link-freetext" href="http://bioinf.mpi-inf.mpg.de/~lawyer">http://bioinf.mpi-inf.mpg.de/~lawyer</a>
</pre>
</body>
</html>