+Now using cs files rather then the dll
*some profiling files needed exclusion
*Vector compare logic and *Edge getOtherVector

Vectors now compare with their VectorID which hopefully will be faster
Edge.getOtherVector now throws an exception rather then returns null if
the Edge doesn't have two points so that Graph.getConnectedEdges no
longer has to check for null as well as .Visited
*Null returning was needed so change made

Now getConnectedEdges uses a nested if though I don't think that matters
*instead of .count set an int to that to use
*otherVector set to the it not called twice
*exchanged for loop with foreach

Replaced the for loop with a foreach loop in get connected edges to test
if this would do anything.
*seeing if _vectorid was faster then vectorID
*replaced random map with a preset

This will allow testing of the algorithm without any randomness
*Everything but the algorithm is commented out
*restrict getConnectedEdges to just own edges

Instead of going through all edges I now have a dictionary for each
point with the vectorID as the key and a list of all edges attached to
the vector being what it contains.
*Set stuff to normal but with improvements
Returned to using dll