Boost logo

Boost :

From: hankel_o_fung_at_[hidden]
Date: 2001-03-12 22:46:14

--- In boost_at_y..., lums_at_l... wrote:
> I assume you are getting a run-time error of some kind?
Yes, usually
'The instruction at "0xblahblah" referenced memory at
 "0x00000000". The memory could not be "written"'.

> Are you running out of memory?
> Taking a quick look without trying to compile or to run the code,
> brings us up to 72MB.
Hmmm, yes. In fact, I estimated the memory requirement after the
execution failed before I posted. Since my NT box has 384MB of
memory, I didn't think the program ran out of memory. Now your
message reminds me to check the Windows NT task manager. Sadly,
the program does run out of memory.

> With some more overhead here or there, this could get somewhat
> larger. This is still what *I* would call a moderately sized
> graph, however, if you are using a PC (implied by VC++), this
> might be pushing it.
Perhaps. However, although VC++'s is unable to allocate a big
(...2MB?!) chunk of memory:

int main() {double array[512][512];} // fails to allocate 2MB

it should be able to allocate a large number of small chunks of
memory. This confuses me, as I think BGL's adjacency_list is
really implemented using an adjacency list, which is made up of
many (comparatively shorter) edge lists and a vertex list.


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