Always repartition mesh nodes
Always repartition mesh nodes

This fixes potential errors resulting from adaptive mesh coarsening:

Imagine a node N connected to element E on partition 1 and B on
partition 2.  By current libMesh rules, N.processor_id() should be 1.

Now imagine that E is coarsened away, and N is not also a node of
E->parent().  Now, N.processor_id() should be 2.  But if
skip_partitioning is true, N.processor_id() will remain 1.  When
processor 1 notices that it owns a node but no elements connected to
that node, then assertions (and algorithms, later) fail.

Mbewu/libmesh,Mbewu/libmesh,Mbewu/libmesh,Mbewu/libmesh,Mbewu/libmesh,Mbewu/libmesh,Mbewu/libmesh,Mbewu/libmesh,Mbewu/libmesh