Boost C++ Libraries: Ticket #10896: astar_maze.cpp: Debug assertion under Windows MSVC-12

attachment set

georg@… — Wed, 24 Dec 2014 12:34:25 GMT

attachment → astar-maze.zip

attachment set

anonymous — Wed, 24 Dec 2014 12:34:40 GMT

attachment → call-stack.txt

georg@… — Wed, 24 Dec 2014 12:36:14 GMT

I decided to dont upload the minidump because the minidump is too big (40 MB).

georg@… — Wed, 24 Dec 2014 12:37:28 GMT

P.S.: I forgot to mention, under release build the executable doesnt dump and it solves the maze.

component changed; owner set

georg@… — Wed, 24 Dec 2014 12:44:37 GMT

owner set to Jeremiah Willcock
component None → graph

attachment set

georg@… — Fri, 26 Dec 2014 12:34:36 GMT

attachment → astar_maze2.cpp

rewritten sample astar_maze2.cpp

georg@… — Fri, 26 Dec 2014 12:35:12 GMT

I added the rewritten sample.

anonymous — Wed, 16 Dec 2015 14:35:48 GMT

A simpler solution would be to have random_maze function return a pointer to maze, as below.

maze* random_maze(std::size_t x, std::size_t y) {

maze* m = new maze(x, y); vertices_size_type n = num_vertices(m->m_grid); vertex_descriptor s = m->source(); vertex_descriptor g = m->goal(); One quarter of the cells in the maze should be barriers. int barriers = n / 4;

while (barriers > 0) {

Choose horizontal or vertical direction. std::size_t direction = random_int(0, 1); Walls range up to one quarter the dimension length in this direction. vertices_size_type wall = random_int(1, m->length(direction) / 4); Create the wall while decrementing the total barrier count. vertex_descriptor u = vertex(random_int(0, n - 1), m->m_grid); while (wall) {

Start and goal spaces should never be barriers. if (u != s && u != g) {

wall--; if (!m->has_barrier(u)) {

m->m_barriers.insert(u); barriers--;

}

} vertex_descriptor v = m->m_grid.next(u, direction); Stop creating this wall if we reached the maze's edge. if (u == v)

break;

u = v;

}

}

return m;

}