diff --git a/releasenotes/notes/prunesearch-finish-vertex-runtimeerror-9c4a1e7b2f83d605.yaml b/releasenotes/notes/prunesearch-finish-vertex-runtimeerror-9c4a1e7b2f83d605.yaml
new file mode 100644
index 0000000000..9a67f0f8d6
--- /dev/null
+++ b/releasenotes/notes/prunesearch-finish-vertex-runtimeerror-9c4a1e7b2f83d605.yaml
@@ -0,0 +1,13 @@
+---
+fixes:
+  - |
+    Fixed :func:`~rustworkx.bfs_search`, :func:`~rustworkx.dfs_search` and
+    :func:`~rustworkx.dijkstra_search` raising a
+    ``pyo3_runtime.PanicException`` when a visitor raises
+    :class:`~rustworkx.visit.PruneSearch` from its ``finish_vertex`` event.
+    Pruning is not possible once a vertex is finished, so this was always an
+    error, but ``PanicException`` inherits from ``BaseException`` instead of
+    ``Exception``, so it was not caught by an ``except Exception`` block, and a
+    panic message was printed to ``stderr`` alongside the Python traceback. A
+    ``RuntimeError`` is now raised instead. Refer to
+    `#1383 <https://github.com/Qiskit/rustworkx/issues/1383>`__ for more details.
diff --git a/rustworkx/__init__.py b/rustworkx/__init__.py
index 24660f76c5..3a737647c3 100644
--- a/rustworkx/__init__.py
+++ b/rustworkx/__init__.py
@@ -1834,8 +1834,8 @@ def tree_edge(self, edge):
 
     .. note::
 
-        An exception is raised if the :class:`~rustworkx.visit.PruneSearch` is
-        raised in the :class:`~rustworkx.visit.BFSVisitor.finish_vertex` event.
+        A ``RuntimeError`` is raised if :class:`~rustworkx.visit.PruneSearch` is
+        raised in the :meth:`~rustworkx.visit.BFSVisitor.finish_vertex` event.
 
 
     :param graph: The graph to be used. This can be a :class:`~rustworkx.PyGraph`
@@ -1930,8 +1930,8 @@ def tree_edge(self, edge):
 
     .. note::
 
-        An exception is raised if the :class:`~rustworkx.visit.PruneSearch` is
-        raised in the :class:`~rustworkx.visit.DFSVisitor.finish_vertex` event.
+        A ``RuntimeError`` is raised if :class:`~rustworkx.visit.PruneSearch` is
+        raised in the :meth:`~rustworkx.visit.DFSVisitor.finish_vertex` event.
 
     :param graph: The graph to be used. This can be a :class:`~rustworkx.PyGraph`
         or a :class:`~rustworkx.PyDiGraph`
@@ -2042,8 +2042,8 @@ def edge_relaxed(self, edge):
 
     .. note::
 
-        An exception is raised if the :class:`~rustworkx.visit.PruneSearch` is
-        raised in the :class:`~rustworkx.visit.DijkstraVisitor.finish_vertex` event.
+        A ``RuntimeError`` is raised if :class:`~rustworkx.visit.PruneSearch` is
+        raised in the :meth:`~rustworkx.visit.DijkstraVisitor.finish_vertex` event.
 
     :param graph: The graph to be used. This can be a :class:`~rustworkx.PyGraph`
         or a :class:`~rustworkx.PyDiGraph`.
diff --git a/src/traversal/bfs_visit.rs b/src/traversal/bfs_visit.rs
index ef7f87ce27..16b7220436 100644
--- a/src/traversal/bfs_visit.rs
+++ b/src/traversal/bfs_visit.rs
@@ -10,6 +10,7 @@
 // License for the specific language governing permissions and limitations
 // under the License.
 
+use pyo3::exceptions::PyRuntimeError;
 use pyo3::prelude::*;
 
 use petgraph::stable_graph::NodeIndex;
@@ -33,6 +34,11 @@ pub fn bfs_handler(
     vis: &PyBfsVisitor,
     event: BfsEvent<NodeIndex, &Py<PyAny>>,
 ) -> PyResult<Control<()>> {
+    // There is nothing left to prune once a vertex is finished, and the core
+    // traversal panics on a `Prune` for that event. Catch it here instead, so
+    // Python callers get a regular exception.
+    let is_finish = matches!(&event, BfsEvent::Finish(..));
+
     let res = match event {
         BfsEvent::Discover(u) => vis.discover_vertex.call1(py, (u.index(),)),
         BfsEvent::TreeEdge(u, v, weight) => {
@@ -57,7 +63,13 @@ pub fn bfs_handler(
     match res {
         Err(e) => {
             if e.is_instance_of::<PruneSearch>(py) {
-                Ok(Control::Prune)
+                if is_finish {
+                    Err(PyRuntimeError::new_err(
+                        "Pruning on the `finish_vertex` event is not supported",
+                    ))
+                } else {
+                    Ok(Control::Prune)
+                }
             } else if e.is_instance_of::<StopSearch>(py) {
                 Ok(Control::Break(()))
             } else {
diff --git a/src/traversal/dfs_visit.rs b/src/traversal/dfs_visit.rs
index b70d3263db..aea2b271ff 100644
--- a/src/traversal/dfs_visit.rs
+++ b/src/traversal/dfs_visit.rs
@@ -10,6 +10,7 @@
 // License for the specific language governing permissions and limitations
 // under the License.
 
+use pyo3::exceptions::PyRuntimeError;
 use pyo3::prelude::*;
 
 use petgraph::stable_graph::NodeIndex;
@@ -32,6 +33,11 @@ pub fn dfs_handler(
     vis: &PyDfsVisitor,
     event: DfsEvent<NodeIndex, &Py<PyAny>>,
 ) -> PyResult<Control<()>> {
+    // There is nothing left to prune once a vertex is finished, and the core
+    // traversal panics on a `Prune` for that event. Catch it here instead, so
+    // Python callers get a regular exception.
+    let is_finish = matches!(&event, DfsEvent::Finish(..));
+
     let res = match event {
         DfsEvent::Discover(u, Time(t)) => vis.discover_vertex.call1(py, (u.index(), t)),
         DfsEvent::TreeEdge(u, v, weight) => {
@@ -52,7 +58,13 @@ pub fn dfs_handler(
     match res {
         Err(e) => {
             if e.is_instance_of::<PruneSearch>(py) {
-                Ok(Control::Prune)
+                if is_finish {
+                    Err(PyRuntimeError::new_err(
+                        "Pruning on the `finish_vertex` event is not supported",
+                    ))
+                } else {
+                    Ok(Control::Prune)
+                }
             } else {
                 Err(e)
             }
diff --git a/src/traversal/dijkstra_visit.rs b/src/traversal/dijkstra_visit.rs
index 8b44ade6c4..47005a91c6 100644
--- a/src/traversal/dijkstra_visit.rs
+++ b/src/traversal/dijkstra_visit.rs
@@ -10,6 +10,7 @@
 // License for the specific language governing permissions and limitations
 // under the License.
 
+use pyo3::exceptions::PyRuntimeError;
 use pyo3::prelude::*;
 
 use petgraph::stable_graph::NodeIndex;
@@ -32,6 +33,11 @@ pub fn dijkstra_handler(
     vis: &PyDijkstraVisitor,
     event: DijkstraEvent<NodeIndex, &Py<PyAny>, f64>,
 ) -> PyResult<Control<()>> {
+    // There is nothing left to prune once a vertex is finished, and the core
+    // traversal panics on a `Prune` for that event. Catch it here instead, so
+    // Python callers get a regular exception.
+    let is_finish = matches!(&event, DijkstraEvent::Finish(..));
+
     let res = match event {
         DijkstraEvent::Discover(u, score) => vis.discover_vertex.call1(py, (u.index(), score)),
         DijkstraEvent::ExamineEdge(u, v, weight) => {
@@ -52,7 +58,13 @@ pub fn dijkstra_handler(
     match res {
         Err(e) => {
             if e.is_instance_of::<PruneSearch>(py) {
-                Ok(Control::Prune)
+                if is_finish {
+                    Err(PyRuntimeError::new_err(
+                        "Pruning on the `finish_vertex` event is not supported",
+                    ))
+                } else {
+                    Ok(Control::Prune)
+                }
             } else if e.is_instance_of::<StopSearch>(py) {
                 Ok(Control::Break(()))
             } else {
diff --git a/src/traversal/mod.rs b/src/traversal/mod.rs
index 33db7361a7..cb7b7e700d 100644
--- a/src/traversal/mod.rs
+++ b/src/traversal/mod.rs
@@ -416,8 +416,8 @@ pub fn descendants(graph: &digraph::PyDiGraph, node: usize) -> PyResult<HashSet<
 ///
 /// .. note::
 ///
-///     An exception is raised if the :class:`~rustworkx.visit.PruneSearch` is
-///     raised in the :class:`~rustworkx.visit.BFSVisitor.finish_vertex` event.
+///     A ``RuntimeError`` is raised if :class:`~rustworkx.visit.PruneSearch` is
+///     raised in the :meth:`~rustworkx.visit.BFSVisitor.finish_vertex` event.
 ///
 ///
 /// :param PyDiGraph graph: The graph to be used.
@@ -562,8 +562,8 @@ pub fn digraph_bfs_search(
 ///
 ///
 /// .. note::
-///     An exception is raised if the :class:`~rustworkx.visit.PruneSearch` is raised in the
-///     :class:`~rustworkx.visit.BFSVisitor.finish_vertex` event.
+///     A ``RuntimeError`` is raised if :class:`~rustworkx.visit.PruneSearch` is raised in the
+///     :meth:`~rustworkx.visit.BFSVisitor.finish_vertex` event.
 ///
 ///
 /// :param PyGraph graph: The graph to be used.
@@ -679,8 +679,8 @@ pub fn graph_bfs_search(
 ///
 ///
 /// .. note::
-///     An exception is raised if the :class:`~rustworkx.visit.PruneSearch` is
-///     raised in the :class:`~rustworkx.visit.DFSVisitor.finish_vertex` event.
+///     A ``RuntimeError`` is raised if :class:`~rustworkx.visit.PruneSearch` is
+///     raised in the :meth:`~rustworkx.visit.DFSVisitor.finish_vertex` event.
 ///
 /// :param PyDiGraph graph: The graph to be used.
 /// :param source: An optional list of node indices to use as the starting nodes
@@ -795,8 +795,8 @@ pub fn digraph_dfs_search(
 ///
 ///
 /// .. note::
-///     An exception is raised if the :class:`~rustworkx.visit.PruneSearch` is
-///     raised in the :class:`~rustworkx.visit.DFSVisitor.finish_vertex` event.
+///     A ``RuntimeError`` is raised if :class:`~rustworkx.visit.PruneSearch` is
+///     raised in the :meth:`~rustworkx.visit.DFSVisitor.finish_vertex` event.
 ///
 /// :param PyGraph graph: The graph to be used.
 /// :param source: An optional list of node indices to use as the starting nodes
@@ -929,8 +929,8 @@ pub fn graph_dfs_search(
 ///
 /// .. note::
 ///
-///    An exception is raised if the :class:`~rustworkx.visit.PruneSearch` is
-///    raised in the :class:`~rustworkx.visit.DijkstraVisitor.finish_vertex` event.
+///    A ``RuntimeError`` is raised if :class:`~rustworkx.visit.PruneSearch` is
+///    raised in the :meth:`~rustworkx.visit.DijkstraVisitor.finish_vertex` event.
 ///
 /// :param PyDiGraph graph: The graph to be used.
 /// :param source: An optional list of node indices to use as the starting nodes
@@ -1072,8 +1072,8 @@ pub fn digraph_dijkstra_search(
 ///
 /// .. note::
 ///
-///    An exception is raised if the :class:`~rustworkx.visit.PruneSearch` is
-///    raised in the :class:`~rustworkx.visit.DijkstraVisitor.finish_vertex` event.
+///    A ``RuntimeError`` is raised if :class:`~rustworkx.visit.PruneSearch` is
+///    raised in the :meth:`~rustworkx.visit.DijkstraVisitor.finish_vertex` event.
 ///
 /// :param PyGraph graph: The graph to be used.
 /// :param source: An optional list of node indices to use as the starting nodes
diff --git a/tests/digraph/test_bfs_search.py b/tests/digraph/test_bfs_search.py
index 9f82c3f85c..e510677e50 100644
--- a/tests/digraph/test_bfs_search.py
+++ b/tests/digraph/test_bfs_search.py
@@ -158,6 +158,51 @@ def gray_target_edge(self, _):
         vis = PruneGrayTargetEdge()
         rustworkx.digraph_bfs_search(self.graph, [0], vis)
 
+    def test_digraph_prune_finish_vertex(self):
+        class PruneFinishVertex(rustworkx.visit.BFSVisitor):
+            def finish_vertex(self, v):
+                raise rustworkx.visit.PruneSearch
+
+        vis = PruneFinishVertex()
+        with self.assertRaisesRegex(RuntimeError, "finish_vertex"):
+            rustworkx.digraph_bfs_search(self.graph, [0], vis)
+
+    def test_digraph_prune_finish_vertex_mid_traversal(self):
+        class PruneSecondFinish(rustworkx.visit.BFSVisitor):
+            def __init__(self):
+                self.finished = []
+
+            def finish_vertex(self, v):
+                self.finished.append(v)
+                if len(self.finished) == 2:
+                    raise rustworkx.visit.PruneSearch
+
+        vis = PruneSecondFinish()
+        with self.assertRaisesRegex(RuntimeError, "finish_vertex"):
+            rustworkx.digraph_bfs_search(self.graph, [0], vis)
+        self.assertEqual(vis.finished, [0, 2])
+
+    def test_digraph_prune_finish_vertex_no_starting_point(self):
+        class PruneFinishVertex(rustworkx.visit.BFSVisitor):
+            def finish_vertex(self, v):
+                raise rustworkx.visit.PruneSearch
+
+        with self.assertRaisesRegex(RuntimeError, "finish_vertex"):
+            rustworkx.digraph_bfs_search(self.graph, None, PruneFinishVertex())
+
+    def test_digraph_stop_search_finish_vertex(self):
+        class StopFinishVertex(rustworkx.visit.BFSVisitor):
+            def __init__(self):
+                self.finished = []
+
+            def finish_vertex(self, v):
+                self.finished.append(v)
+                raise rustworkx.visit.StopSearch
+
+        vis = StopFinishVertex()
+        rustworkx.digraph_bfs_search(self.graph, [0], vis)
+        self.assertEqual(vis.finished, [0])
+
     def test_invalid_source(self):
         graph = rustworkx.PyDiGraph()
         with self.assertRaises(IndexError):
diff --git a/tests/digraph/test_dfs_search.py b/tests/digraph/test_dfs_search.py
index 7b7bb0de92..e5980e06d7 100644
--- a/tests/digraph/test_dfs_search.py
+++ b/tests/digraph/test_dfs_search.py
@@ -103,6 +103,52 @@ def reconstruct_path(self):
             pass
         self.assertEqual(vis.reconstruct_path(), [0, 2, 5, 3])
 
+    def test_digraph_prune_finish_vertex(self):
+        class PruneFinishVertex(rustworkx.visit.DFSVisitor):
+            def finish_vertex(self, v, t):
+                raise rustworkx.visit.PruneSearch
+
+        vis = PruneFinishVertex()
+        with self.assertRaisesRegex(RuntimeError, "finish_vertex"):
+            rustworkx.digraph_dfs_search(self.graph, [0], vis)
+
+    def test_digraph_prune_finish_vertex_mid_traversal(self):
+        class PruneSecondFinish(rustworkx.visit.DFSVisitor):
+            def __init__(self):
+                self.finished = []
+
+            def finish_vertex(self, v, t):
+                self.finished.append(v)
+                if len(self.finished) == 2:
+                    raise rustworkx.visit.PruneSearch
+
+        vis = PruneSecondFinish()
+        with self.assertRaisesRegex(RuntimeError, "finish_vertex"):
+            rustworkx.digraph_dfs_search(self.graph, [0], vis)
+        self.assertEqual(vis.finished, [6, 3])
+
+    def test_digraph_prune_finish_vertex_no_starting_point(self):
+        class PruneFinishVertex(rustworkx.visit.DFSVisitor):
+            def finish_vertex(self, v, t):
+                raise rustworkx.visit.PruneSearch
+
+        with self.assertRaisesRegex(RuntimeError, "finish_vertex"):
+            rustworkx.digraph_dfs_search(self.graph, None, PruneFinishVertex())
+
+    def test_digraph_stop_search_finish_vertex(self):
+        class StopFinishVertex(rustworkx.visit.DFSVisitor):
+            def __init__(self):
+                self.finished = []
+
+            def finish_vertex(self, v, t):
+                self.finished.append(v)
+                raise rustworkx.visit.StopSearch
+
+        vis = StopFinishVertex()
+        with self.assertRaises(rustworkx.visit.StopSearch):
+            rustworkx.digraph_dfs_search(self.graph, [0], vis)
+        self.assertEqual(vis.finished, [6])
+
     def test_invalid_source(self):
         graph = rustworkx.PyDiGraph()
         with self.assertRaises(IndexError):
diff --git a/tests/digraph/test_dijkstra_search.py b/tests/digraph/test_dijkstra_search.py
index f92cfdffc9..6cee65ea7a 100644
--- a/tests/digraph/test_dijkstra_search.py
+++ b/tests/digraph/test_dijkstra_search.py
@@ -185,6 +185,51 @@ def edge_not_relaxed(self, _):
         vis = PruneEdgeNotRelaxed()
         rustworkx.digraph_dijkstra_search(self.graph, [0], float, vis)
 
+    def test_digraph_prune_finish_vertex(self):
+        class PruneFinishVertex(rustworkx.visit.DijkstraVisitor):
+            def finish_vertex(self, v):
+                raise rustworkx.visit.PruneSearch
+
+        vis = PruneFinishVertex()
+        with self.assertRaisesRegex(RuntimeError, "finish_vertex"):
+            rustworkx.digraph_dijkstra_search(self.graph, [0], float, vis)
+
+    def test_digraph_prune_finish_vertex_mid_traversal(self):
+        class PruneSecondFinish(rustworkx.visit.DijkstraVisitor):
+            def __init__(self):
+                self.finished = []
+
+            def finish_vertex(self, v):
+                self.finished.append(v)
+                if len(self.finished) == 2:
+                    raise rustworkx.visit.PruneSearch
+
+        vis = PruneSecondFinish()
+        with self.assertRaisesRegex(RuntimeError, "finish_vertex"):
+            rustworkx.digraph_dijkstra_search(self.graph, [0], float, vis)
+        self.assertEqual(vis.finished, [0, 1])
+
+    def test_digraph_prune_finish_vertex_no_starting_point(self):
+        class PruneFinishVertex(rustworkx.visit.DijkstraVisitor):
+            def finish_vertex(self, v):
+                raise rustworkx.visit.PruneSearch
+
+        with self.assertRaisesRegex(RuntimeError, "finish_vertex"):
+            rustworkx.digraph_dijkstra_search(self.graph, None, float, PruneFinishVertex())
+
+    def test_digraph_stop_search_finish_vertex(self):
+        class StopFinishVertex(rustworkx.visit.DijkstraVisitor):
+            def __init__(self):
+                self.finished = []
+
+            def finish_vertex(self, v):
+                self.finished.append(v)
+                raise rustworkx.visit.StopSearch
+
+        vis = StopFinishVertex()
+        rustworkx.digraph_dijkstra_search(self.graph, [0], float, vis)
+        self.assertEqual(vis.finished, [0])
+
     def test_invalid_source(self):
         graph = rustworkx.PyDiGraph()
         with self.assertRaises(IndexError):
diff --git a/tests/graph/test_bfs_search.py b/tests/graph/test_bfs_search.py
index 000999c574..8dc511543a 100644
--- a/tests/graph/test_bfs_search.py
+++ b/tests/graph/test_bfs_search.py
@@ -158,6 +158,51 @@ def gray_target_edge(self, _):
         vis = PruneGrayTargetEdge()
         rustworkx.graph_bfs_search(self.graph, [0], vis)
 
+    def test_graph_prune_finish_vertex(self):
+        class PruneFinishVertex(rustworkx.visit.BFSVisitor):
+            def finish_vertex(self, v):
+                raise rustworkx.visit.PruneSearch
+
+        vis = PruneFinishVertex()
+        with self.assertRaisesRegex(RuntimeError, "finish_vertex"):
+            rustworkx.graph_bfs_search(self.graph, [0], vis)
+
+    def test_graph_prune_finish_vertex_mid_traversal(self):
+        class PruneSecondFinish(rustworkx.visit.BFSVisitor):
+            def __init__(self):
+                self.finished = []
+
+            def finish_vertex(self, v):
+                self.finished.append(v)
+                if len(self.finished) == 2:
+                    raise rustworkx.visit.PruneSearch
+
+        vis = PruneSecondFinish()
+        with self.assertRaisesRegex(RuntimeError, "finish_vertex"):
+            rustworkx.graph_bfs_search(self.graph, [0], vis)
+        self.assertEqual(vis.finished, [0, 2])
+
+    def test_graph_prune_finish_vertex_no_starting_point(self):
+        class PruneFinishVertex(rustworkx.visit.BFSVisitor):
+            def finish_vertex(self, v):
+                raise rustworkx.visit.PruneSearch
+
+        with self.assertRaisesRegex(RuntimeError, "finish_vertex"):
+            rustworkx.graph_bfs_search(self.graph, None, PruneFinishVertex())
+
+    def test_graph_stop_search_finish_vertex(self):
+        class StopFinishVertex(rustworkx.visit.BFSVisitor):
+            def __init__(self):
+                self.finished = []
+
+            def finish_vertex(self, v):
+                self.finished.append(v)
+                raise rustworkx.visit.StopSearch
+
+        vis = StopFinishVertex()
+        rustworkx.graph_bfs_search(self.graph, [0], vis)
+        self.assertEqual(vis.finished, [0])
+
     def test_invalid_source(self):
         graph = rustworkx.PyGraph()
         with self.assertRaises(IndexError):
diff --git a/tests/graph/test_dfs_search.py b/tests/graph/test_dfs_search.py
index 951f07fe32..caeebb8f52 100644
--- a/tests/graph/test_dfs_search.py
+++ b/tests/graph/test_dfs_search.py
@@ -103,6 +103,52 @@ def reconstruct_path(self):
             pass
         self.assertEqual(vis.reconstruct_path(), [0, 2, 5, 3])
 
+    def test_graph_prune_finish_vertex(self):
+        class PruneFinishVertex(rustworkx.visit.DFSVisitor):
+            def finish_vertex(self, v, t):
+                raise rustworkx.visit.PruneSearch
+
+        vis = PruneFinishVertex()
+        with self.assertRaisesRegex(RuntimeError, "finish_vertex"):
+            rustworkx.graph_dfs_search(self.graph, [0], vis)
+
+    def test_graph_prune_finish_vertex_mid_traversal(self):
+        class PruneSecondFinish(rustworkx.visit.DFSVisitor):
+            def __init__(self):
+                self.finished = []
+
+            def finish_vertex(self, v, t):
+                self.finished.append(v)
+                if len(self.finished) == 2:
+                    raise rustworkx.visit.PruneSearch
+
+        vis = PruneSecondFinish()
+        with self.assertRaisesRegex(RuntimeError, "finish_vertex"):
+            rustworkx.graph_dfs_search(self.graph, [0], vis)
+        self.assertEqual(vis.finished, [6, 1])
+
+    def test_graph_prune_finish_vertex_no_starting_point(self):
+        class PruneFinishVertex(rustworkx.visit.DFSVisitor):
+            def finish_vertex(self, v, t):
+                raise rustworkx.visit.PruneSearch
+
+        with self.assertRaisesRegex(RuntimeError, "finish_vertex"):
+            rustworkx.graph_dfs_search(self.graph, None, PruneFinishVertex())
+
+    def test_graph_stop_search_finish_vertex(self):
+        class StopFinishVertex(rustworkx.visit.DFSVisitor):
+            def __init__(self):
+                self.finished = []
+
+            def finish_vertex(self, v, t):
+                self.finished.append(v)
+                raise rustworkx.visit.StopSearch
+
+        vis = StopFinishVertex()
+        with self.assertRaises(rustworkx.visit.StopSearch):
+            rustworkx.graph_dfs_search(self.graph, [0], vis)
+        self.assertEqual(vis.finished, [6])
+
     def test_invalid_source(self):
         graph = rustworkx.PyGraph()
         with self.assertRaises(IndexError):
diff --git a/tests/graph/test_dijkstra_search.py b/tests/graph/test_dijkstra_search.py
index dd723a3e24..db33ec19cb 100644
--- a/tests/graph/test_dijkstra_search.py
+++ b/tests/graph/test_dijkstra_search.py
@@ -185,6 +185,51 @@ def edge_not_relaxed(self, _):
         vis = PruneEdgeNotRelaxed()
         rustworkx.graph_dijkstra_search(self.graph, [0], float, vis)
 
+    def test_graph_prune_finish_vertex(self):
+        class PruneFinishVertex(rustworkx.visit.DijkstraVisitor):
+            def finish_vertex(self, v):
+                raise rustworkx.visit.PruneSearch
+
+        vis = PruneFinishVertex()
+        with self.assertRaisesRegex(RuntimeError, "finish_vertex"):
+            rustworkx.graph_dijkstra_search(self.graph, [0], float, vis)
+
+    def test_graph_prune_finish_vertex_mid_traversal(self):
+        class PruneSecondFinish(rustworkx.visit.DijkstraVisitor):
+            def __init__(self):
+                self.finished = []
+
+            def finish_vertex(self, v):
+                self.finished.append(v)
+                if len(self.finished) == 2:
+                    raise rustworkx.visit.PruneSearch
+
+        vis = PruneSecondFinish()
+        with self.assertRaisesRegex(RuntimeError, "finish_vertex"):
+            rustworkx.graph_dijkstra_search(self.graph, [0], float, vis)
+        self.assertEqual(vis.finished, [0, 1])
+
+    def test_graph_prune_finish_vertex_no_starting_point(self):
+        class PruneFinishVertex(rustworkx.visit.DijkstraVisitor):
+            def finish_vertex(self, v):
+                raise rustworkx.visit.PruneSearch
+
+        with self.assertRaisesRegex(RuntimeError, "finish_vertex"):
+            rustworkx.graph_dijkstra_search(self.graph, None, float, PruneFinishVertex())
+
+    def test_graph_stop_search_finish_vertex(self):
+        class StopFinishVertex(rustworkx.visit.DijkstraVisitor):
+            def __init__(self):
+                self.finished = []
+
+            def finish_vertex(self, v):
+                self.finished.append(v)
+                raise rustworkx.visit.StopSearch
+
+        vis = StopFinishVertex()
+        rustworkx.graph_dijkstra_search(self.graph, [0], float, vis)
+        self.assertEqual(vis.finished, [0])
+
     def test_invalid_source(self):
         graph = rustworkx.PyGraph()
         with self.assertRaises(IndexError):