Boost logo

Boost :

From: Jeremy Siek (jsiek_at_[hidden])
Date: 2002-10-08 16:30:03

Hi Narayanan,

Sorry, I don't know of anyone who has done timings for adjacency_matrix.
We did timings for variations of adjacency_list in the BGL book, but not
adjacency_matrix. If you do experiments I'd be interested in hearing the


On Tue, 8 Oct 2002, Narayanan Krishnan wrote:

naraya> Hello,
naraya> Could anyone shed some light from prior experience on pros and cons of
naraya> using an adjacency_list representation versus an adjacency_matrix
naraya> representation for moderate sized directed, weakly to strongly
naraya> connected, acyclic graphs (approx. 100,000 vertices). Which would be
naraya> more suitable ? Are there any other recommended structures ? Operations
naraya> I am interested in are Shortest Path determination and Cost-effective
naraya> searches.
naraya> Thanks in advance.
naraya> Narayanan Krishnan

 Jeremy Siek
 Ph.D. Student, Indiana Univ. B'ton email: jsiek_at_[hidden]
 C++ Booster ( office phone: (812) 855-3608

Boost list run by bdawes at, gregod at, cpdaniel at, john at