Acces violation Dijkstra Algorithm

Status: Planning

Brought to you by: thunderjordi

#3 Acces violation Dijkstra Algorithm

Milestone: v1.0 (example)

Status: closed-fixed

Owner: Jordi Coll

Labels: Nodes (2)

Priority: 9

Updated: 2010-02-19

Created: 2010-02-19

Private: No

If there are too many nodes, the algorithm throws an exception

Jordi Coll - 2010-02-19

status: open --> closed-fixed
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:

Jordi Coll - 2010-02-19

Fixed in the last version. It's a little bug of dimensioning an edge list only for 100 elements.

If you would like to refer to this comment somewhere else in this project, copy and paste the following link: