Think about Loose Coupling | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
Dear Perl Monks I've developed a brute-force solution for a local transfer company which works fine BUT it uses a pure perl encoded version of the Dijkstra algorithm. This works fine, but proves to be the main consumer of CPU time (according to the superb NYTProf profiler) What I'd like to try is Boost::Graph, but I just cant get it to compile under Windows (Vista Ultimate) either under ActiveState or Strawberry Perl. So, my question is, if any of you have successfully compiled Boost::Graph under windows and how. Many Thanks Gangulphus In reply to Travelling Salesman by gangulphus
|
|