News:

Tekforums.net - The improved home of Tekforums! :D

Main Menu

Route planning assistance

Started by soopahfly, March 18, 2008, 19:03:49 PM

Previous topic - Next topic

0 Members and 1 Guest are viewing this topic.

Print
Go Down Pages 1 2
User actions

M3ta7h3ad

#15
March 20, 2008, 00:44:48 AM
Quote from: SamIts called the travelling salesman problem and has complexity of O(n!)

Dijkstras algorithm will solve that same problem in O(n^2) IIRC.

Sam

#16
March 20, 2008, 01:43:03 AM
Quote from: M3ta7h3ad
Quote from: SamIts called the travelling salesman problem and has complexity of O(n!)

Dijkstras algorithm will solve that same problem in O(n^2) IIRC.

Well it certainly aint n2
I looked it up and its apparantly O(n^2.2^n)) which Im not sure I believe.
Print
Go Up Pages 1 2
User actions