expose findNearestNode methods and findPointOnEdge, as they can be us…

…eful being public

Sources/Graph3D/Graph3D.swift

@@ -63,20 +63,20 @@ public class Graph3D: GKGraph {
   }
 
 
-  internal func findNearestNode(to position: SIMD3<Float>, between nodes: [RouteVertex]) -> RouteVertex {
+  public func findNearestNode(to position: SIMD3<Float>, between nodes: [RouteVertex]) -> RouteVertex {
     let newNode = RouteVertex(position)
     return nodes.reduce(nodes[0]) { (best, next) -> RouteVertex in
       return newNode.cost(to: next) < newNode.cost(to: best) ? next : best
     }
   }
 
-  internal func findNearestNode(to position: SIMD3<Float>) -> RouteVertex {
+  public func findNearestNode(to position: SIMD3<Float>) -> RouteVertex {
     return self.findNearestNode(to: position, between: self.vertexNodes)
   }
 
 
   /// Find the closest point on the graph to a given point
-  internal func findPointOnEdge(from startPoint: SIMD3<Float>) -> (SIMD3<Float>, [RouteVertex]) {
+  public func findPointOnEdge(from startPoint: SIMD3<Float>) -> (SIMD3<Float>, [RouteVertex]) {
     var closestPoint = self.vertexNodes[edges[0][0]].getVectorPos()
     var closestDistance = startPoint.distance(to: closestPoint)
     var matchingNodes = [self.vertexNodes[edges[0][0]], self.vertexNodes[edges[0][1]]]

Sources/Graph3D/RouteVertex.swift

@@ -7,22 +7,22 @@
 
 import GameplayKit.GKGraph
 
-internal class RouteVertex: GKGraphNode3D {
+public class RouteVertex: GKGraphNode3D {
   var travelCost: [GKGraphNode: Float] = [:]
 
   var simdPos: SIMD3<Float> {
     return SIMD3<Float>(self.position)
   }
 
-  convenience init(position: [Float]) {
+  internal convenience init(position: [Float]) {
     self.init(point: vector_float3(position))
   }
 
-  convenience init(_ position: SIMD3<Float>) {
+  internal convenience init(_ position: SIMD3<Float>) {
     self.init(point: vector_float3(position))
   }
 
-  override init(point: vector_float3) {
+  internal override init(point: vector_float3) {
     super.init(point: point)
   }