How do I solve traveling salesman in O(n)? Pls help. Asking for a fren

How do I solve traveling salesman in O(n)? Pls help. Asking for a fren

Start by solving P=NP.

Quantum computers or some bullshit I dunno

my dad is a traveling encyclopedia salesman.

he's on a long business trip, he will be back soon he told me he would.

>Start by solving P=NP.
let P = 1
let N = 1
P=NP
True

are you retarded

Don't you mean: ``Are you retarded?"?

P = NP
N = P/P
N = 1

P can take any value.

>P can take any value.
kys or try to learn math again

>math
I believe it is called ``Maths'', my child.

Easiest known method:
1. start computation
2. build time machine.
3. travel to estimated completion date

Actually it is called Mathematik

you might be able to exploit some property specific to your problem

I recall a paper about NP is in BQP, but it was redacted and still open?

Distributed computing: have n salesman for n nodes

I just came up with a solution a couple of days ago.

Posting on Sup Forums because fuck it.

Assuming you already have the graph and their respective costs between edges. If there edges are h disconnected set weight = infinity. Now there are two big steps. First is to preprocess the graph.

Preprocess : for every edg

dumb frogposter

hello djikstra my old friend
I've come to traverse graphs again

To be fair "solving P=NP" is a nonsense statement and the bar has been set very low in this thread.

because a network softly creeping
Left its vertices while I was sleeping

Here I have a method that works in O(1):

First is to preprocess the graph. I'll leave that to you as an exercise. Then you just look up the answer O(1)!

Why are links called edges? Why do software "scientists" keep redefining words?

Because pic related is a link, and graph theory is abstract.