Re: Can someone verify if this is an NP complete problem?

In addition to all the other replies, be aware that
almost all instances of an NP-Complete problem are
trivial to solve using standard techniques. Almost
all (in a technical sense) 3-Colouring problems are
trivial, almost all 3-SAT problems are trivial, a.a.
TSPs are trivial, and it's very likely that if you
are in the real world, any instance you have of a
problem is easily solvable.

That's not to say that these issues aren't important,
but they are mostly important to people who need to
understand the internals of how problems work. If
you simply have a big problem that you're trying to
find a solution for, the NPC concern might not be
relevant.
.