Bug Fixes. Bumped to v0.7.89

wassimj · Dec 19, 2024 · a603620 · a603620
1 parent d11f603
commit a603620
Show file tree

Hide file tree

Showing 4 changed files with 111 additions and 424 deletions.
diff --git a/notebooks/Chessboard.ipynb b/notebooks/Chessboard.ipynb
diff --git a/notebooks/GraphByIFCPath.ipynb b/notebooks/GraphByIFCPath.ipynb
diff --git a/src/topologicpy/Graph.py b/src/topologicpy/Graph.py
@@ -9008,6 +9008,7 @@ def _topological_distance(g, start, target):
                     queue.append((neighbor, distance + 1))
 
         return None  # Target not reachable
+
     @staticmethod
     def TopologicalDistance(graph, vertexA, vertexB, tolerance=0.0001):
         """
@@ -9043,14 +9044,21 @@ def TopologicalDistance(graph, vertexA, vertexB, tolerance=0.0001):
         if not Topology.IsInstance(vertexB, "Vertex"):
             print("Graph.TopologicalDistance - Error: The input vertexB is not a valid vertex. Returning None.")
             return None
-        vertices = Graph.Vertices(graph)
+
         g = Graph.AdjacencyDictionary(graph)
+        vertices = Graph.Vertices(graph)
         keys = list(g.keys())
-        index_a = Vertex.Index(vertexA, vertices, tolerance=tolerance)
+        g_vertexA = Graph.NearestVertex(graph, vertexA)
+        g_vertexB = Graph.NearestVertex(graph, vertexB)
+        index_a = Vertex.Index(g_vertexA, vertices, tolerance=tolerance)
+        if index_a == None:
+            return 0
         start = keys[index_a]
-        index_b = Vertex.Index(vertexB, vertices, tolerance=tolerance)
+        index_b = Vertex.Index(g_vertexB, vertices, tolerance=tolerance)
+        if index_b == None:
+            return 0
         target = keys[index_b]
-        return Graph._topological_distance(g, start, target) # Hook to Core
+        return Graph._topological_distance(g, start, target)
 
     @staticmethod
     def Topology(graph):

diff --git a/src/topologicpy/version.py b/src/topologicpy/version.py
@@ -1 +1 @@
-__version__ = '0.7.88'
+__version__ = '0.7.89'