Re: Graph representation compress
- From: Le Chaud Lapin <jaibuduvin@xxxxxxxxx>
- Date: Mon, 11 Aug 2008 21:22:55 -0700 (PDT)
On Aug 8, 12:01 pm, Александр <palgol...@xxxxxxxxx> wrote:
Hi theory guru! I am interested in compress large (spare/complete)
(static/dynamic) graph model representation. What data structures
helps to represent graph with 10.000.000 and more vertexes as compress
as possible. And what data structures provide high performance factor
for such graphs?
Maybe, it ll be coded adjacency matrix or map/multimap, sets or hash
table..?
Hmmm...
I just replied to a very similar post in comp.lang.c++, only the
number was 6.000.000 instead of 10.000.000, so I am curious if there
is any correlation here. :)
http://groups.google.com/group/comp.lang.c++.moderated/browse_frm/thread/bc24afa0bc96f402/
It depends on what you plan to do with the graph. If you only want to
determine adjacency, then that's one matter, but if you need something
to execute, say, Dijkstra's algorithm, you will find that the suitable
data structure suprisingly fat.
What are you doing this for?
-Le Chaud Lapin-
.
- References:
- Graph representation compress
- From: Александр
- Graph representation compress
- Prev by Date: Re: Another approach to decide on existence of a real root for Univariate Polynomials with Integer Coefficients, and a possible Multivariate extension for 3-SAT
- Next by Date: Re: Another approach to decide on existence of a real root for Univariate Polynomials with Integer Coefficients, and a possible Multivariate extension for 3-SAT
- Previous by thread: Graph representation compress
- Next by thread: Re: Another approach to decide on existence of a real root for Univariate Polynomials with Integer Coefficients, and a possible Multivariate extension for 3-SAT
- Index(es):
Relevant Pages
|
