diff --git a/CMakeLists.txt b/CMakeLists.txt
index 35caa594..f41fcac0 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -202,7 +202,6 @@ set(STA_SOURCE
   search/TagGroup.cc
   search/VertexVisitor.cc
   search/VisitPathEnds.cc
-  search/VisitPathGroupVertices.cc
   search/WorstSlack.cc
 
   spice/WritePathSpice.cc
diff --git a/include/sta/Sta.hh b/include/sta/Sta.hh
index 6f29c7ac..f7b233da 100644
--- a/include/sta/Sta.hh
+++ b/include/sta/Sta.hh
@@ -907,9 +907,6 @@ public:
   PinSet endpointPins();
   VertexSet *endpoints();
   int endpointViolationCount(const MinMax *min_max);
-  // Find the fanin vertices for a group path.
-  // Vertices in the clock network are NOT included.
-  PinSet findGroupPathPins(const char *group_path_name);
   // Find all required times after updateTiming().
   void findRequireds();
   std::string reportDelayCalc(Edge *edge,
diff --git a/sdc/Sdc.i b/sdc/Sdc.i
index bf2effd0..2c66e43d 100644
--- a/sdc/Sdc.i
+++ b/sdc/Sdc.i
@@ -1355,19 +1355,6 @@ set_voltage_net(const Net *net,
 
 ////////////////////////////////////////////////////////////////
 
-PinSet
-group_path_pins(const char *group_path_name)
-{
-  Sta *sta = Sta::sta();
-  Sdc *sdc = sta->sdc();
-  if (sdc->isGroupPathName(group_path_name))
-    return sta->findGroupPathPins(group_path_name);
-  else
-    return PinSet(sta->network());
-}
-
-////////////////////////////////////////////////////////////////
-
 char
 pin_case_logic_value(const Pin *pin)
 {
diff --git a/search/Sta.cc b/search/Sta.cc
index 44da4a79..87fe14a9 100644
--- a/search/Sta.cc
+++ b/search/Sta.cc
@@ -75,7 +75,6 @@
 #include "ClkLatency.hh"
 #include "FindRegister.hh"
 #include "ReportPath.hh"
-#include "VisitPathGroupVertices.hh"
 #include "Genclks.hh"
 #include "ClkNetwork.hh"
 #include "power/Power.hh"
@@ -2721,36 +2720,6 @@ Sta::endpointViolationCount(const MinMax *min_max)
   return violations;
 }
 
-PinSet
-Sta::findGroupPathPins(const char *group_path_name)
-{
-  if (!(search_->havePathGroups()
-        && search_->arrivalsValid())) {
-    PathEndSeq path_ends = findPathEnds(// from, thrus, to, unconstrained
-                                        nullptr, nullptr, nullptr, false,
-                                        // corner, min_max, 
-                                        nullptr, MinMaxAll::max(),
-                                        // group_path_count, endpoint_path_count
-                                        1, 1,
-					// unique_pins, unique_edges
-					true, true,
-                                        -INF, INF, // slack_min, slack_max,
-                                        false, // sort_by_slack
-                                        nullptr, // group_names
-                                        // setup, hold, recovery, removal, 
-                                        true, true, true, true,
-                                        // clk_gating_setup, clk_gating_hold
-                                        true, true);
-  }
-
-  PathGroup *path_group = search_->findPathGroup(group_path_name,
-						 MinMax::max());
-  PinSet pins(network_);
-  VertexPinCollector visitor(pins);
-  visitPathGroupVertices(path_group, &visitor, this);
-  return pins;
-}
-
 ////////////////////////////////////////////////////////////////
 
 void
diff --git a/search/VisitPathGroupVertices.cc b/search/VisitPathGroupVertices.cc
deleted file mode 100644
index c733f9b8..00000000
--- a/search/VisitPathGroupVertices.cc
+++ /dev/null
@@ -1,313 +0,0 @@
-// OpenSTA, Static Timing Analyzer
-// Copyright (c) 2025, Parallax Software, Inc.
-// 
-// This program is free software: you can redistribute it and/or modify
-// it under the terms of the GNU General Public License as published by
-// the Free Software Foundation, either version 3 of the License, or
-// (at your option) any later version.
-// 
-// This program is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-// GNU General Public License for more details.
-// 
-// You should have received a copy of the GNU General Public License
-// along with this program. If not, see <https://www.gnu.org/licenses/>.
-// 
-// The origin of this software must not be misrepresented; you must not
-// claim that you wrote the original software.
-// 
-// Altered source versions must be plainly marked as such, and must not be
-// misrepresented as being the original software.
-// 
-// This notice may not be removed or altered from any source distribution.
-
-#include "VisitPathGroupVertices.hh"
-
-#include "Debug.hh"
-#include "Graph.hh"
-#include "Bfs.hh"
-#include "Search.hh"
-#include "Path.hh"
-#include "PathEnd.hh"
-#include "Tag.hh"
-#include "VisitPathEnds.hh"
-
-namespace sta {
-
-typedef Set<Path*, PathLess> PathSet;
-typedef Map<Vertex*, PathSet*> VertexPathSetMap;
-
-static void
-vertexPathSetMapInsertPath(VertexPathSetMap *matching_path_map,
-			   Vertex *vertex,
-			   Tag *tag,
-			   const StaState *sta);
-
-// Visit each path end for a vertex and add the worst one in each
-// path group to the group.
-class VisitPathGroupEnds : public PathEndVisitor
-{
-public:
-  VisitPathGroupEnds(PathGroup *path_group,
-                     VertexVisitor *vertex_visitor,
-                     VertexPathSetMap *matching_path_map,
-                     BfsBkwdIterator *bkwd_iter,
-                     StaState *sta);
-  VisitPathGroupEnds(const VisitPathGroupEnds&) = default;
-  virtual PathEndVisitor *copy() const;
-  virtual void visit(PathEnd *path_end);
-  virtual void vertexBegin(Vertex *vertex);
-  virtual void vertexEnd(Vertex *vertex);
-
-private:
-  PathGroup *path_group_;
-  VertexVisitor *vertex_visitor_;
-  BfsBkwdIterator *bkwd_iter_;
-  VertexPathSetMap *matching_path_map_;
-  bool vertex_matches_;
-  StaState *sta_;
-};
-
-class PathGroupPathVisitor : public PathVisitor
-{
-public:
-  PathGroupPathVisitor(VertexVisitor *visitor,
-		       BfsBkwdIterator *bkwd_iter,
-		       VertexPathSetMap *matching_path_map,
-		       const StaState *sta);
-  virtual ~PathGroupPathVisitor();
-  virtual VertexVisitor *copy() const;
-  virtual void visit(Vertex *vertex);
-
-protected:
-  // Return false to stop visiting.
-  virtual bool visitFromToPath(const Pin *from_pin,
-			       Vertex *from_vertex,
-			       const RiseFall *from_rf,
-			       Tag *from_tag,
-			       Path *from_path,
-                               const Arrival &from_arrival,
-			       Edge *edge,
-			       TimingArc *arc,
-			       ArcDelay arc_delay,
-			       Vertex *to_vertex,
-			       const RiseFall *to_rf,
-			       Tag *to_tag,
-			       Arrival &to_arrival,
-			       const MinMax *min_max,
-			       const PathAnalysisPt *path_ap);
-  void fromMatches(Vertex *from_vertex,
-		   Tag *from_tag);
-
-private:
-  VertexVisitor *visitor_;
-  BfsBkwdIterator *bkwd_iter_;
-  VertexPathSetMap *matching_path_map_;
-  bool vertex_matches_;
-};
-
-////////////////////////////////////////////////////////////////
-
-// Visit the fanin vertices for the path group.
-// Vertices in the clock network are NOT visited.
-void
-visitPathGroupVertices(PathGroup *path_group,
-		       VertexVisitor *visitor,
-		       StaState *sta)
-{
-  Search *search = sta->search();
-  VertexPathSetMap matching_path_map;
-  // Do not visit clock network.
-  SearchPredNonReg2 srch_non_reg(sta);
-  BfsBkwdIterator bkwd_iter(BfsIndex::other, &srch_non_reg, sta);
-  // Visit the path ends and filter by path_group to seed the backward search.
-  VisitPathGroupEnds end_visitor(path_group, visitor, &matching_path_map,
-				 &bkwd_iter, sta);
-  VisitPathEnds visit_path_ends(sta);
-  for(Vertex *vertex : *search->endpoints())
-    visit_path_ends.visitPathEnds(vertex, &end_visitor);
-
-  // Search backward from the path ends thru vertices that have arrival tags
-  // that match path_group end paths.
-  PathGroupPathVisitor path_visitor(visitor, &bkwd_iter, &matching_path_map,
-				    sta);
-  bkwd_iter.visit(0, &path_visitor);
-
-  // Cleanup.
-  VertexPathSetMap::Iterator matching_iter(matching_path_map);
-  while (matching_iter.hasNext()) {
-    PathSet *paths = matching_iter.next();
-    PathSet::Iterator path_iter(paths);
-    while (path_iter.hasNext()) {
-      Path *path = path_iter.next();
-      delete path;
-    }
-    delete paths;
-  }
-}
-
-////////////////////////////////////////////////////////////////
-
-VisitPathGroupEnds::VisitPathGroupEnds(PathGroup *path_group,
-				       VertexVisitor *vertex_visitor,
-				       VertexPathSetMap *matching_path_map,
-				       BfsBkwdIterator *bkwd_iter,
-				       StaState *sta) :
-  path_group_(path_group),
-  vertex_visitor_(vertex_visitor),
-  bkwd_iter_(bkwd_iter),
-  matching_path_map_(matching_path_map),
-  sta_(sta)
-{
-}
-
-PathEndVisitor *
-VisitPathGroupEnds::copy() const
-{
-  return new VisitPathGroupEnds(*this);
-}
-
-void
-VisitPathGroupEnds::vertexBegin(Vertex *)
-{
-  vertex_matches_ = false;
-}
-
-void
-VisitPathGroupEnds::visit(PathEnd *path_end)
-{
-  PathGroupSeq groups = sta_->search()->pathGroups(path_end);
-  for (PathGroup *group : groups) {
-    if (group == path_group_) {
-      Path *path = path_end->path();
-      Vertex *vertex = path->vertex(sta_);
-      vertexPathSetMapInsertPath(matching_path_map_, vertex, path->tag(sta_), sta_);
-      vertex_matches_ = true;
-    }
-  }
-}
-
-static void
-vertexPathSetMapInsertPath(VertexPathSetMap *matching_path_map,
-			   Vertex *vertex,
-			   Tag *tag,
-			   const StaState *sta)
-{
-  PathSet *matching_paths = matching_path_map->findKey(vertex);
-  if (matching_paths == nullptr) {
-    PathLess path_less(sta);
-    matching_paths = new PathSet(path_less);
-    (*matching_path_map)[vertex] = matching_paths;
-  }
-  Path *vpath = new Path(vertex, tag, sta);
-  matching_paths->insert(vpath);
-}
-
-void
-VisitPathGroupEnds::vertexEnd(Vertex *vertex)
-{
-  if (vertex_matches_) {
-    vertex_visitor_->visit(vertex);
-    // Seed backward bfs fanin search.
-    bkwd_iter_->enqueueAdjacentVertices(vertex);
-  }
-}
-
-////////////////////////////////////////////////////////////////
-
-PathGroupPathVisitor::PathGroupPathVisitor(VertexVisitor *visitor,
-					   BfsBkwdIterator *bkwd_iter,
-					   VertexPathSetMap *matching_path_map,
-					   const StaState *sta) :
-  PathVisitor(sta),
-  visitor_(visitor),
-  bkwd_iter_(bkwd_iter),
-  matching_path_map_(matching_path_map)
-{
-}
-
-PathGroupPathVisitor::~PathGroupPathVisitor()
-{
-}
-
-VertexVisitor *
-PathGroupPathVisitor::copy() const
-{
-  return new PathGroupPathVisitor(visitor_, bkwd_iter_,
-                                  matching_path_map_, this);
-}
-
-void
-PathGroupPathVisitor::visit(Vertex *vertex)
-{
-  vertex_matches_ = false;
-  visitFanoutPaths(vertex);
-  if (vertex_matches_) {
-    debugPrint(debug_, "visit_path_group", 1, "visit %s",
-               vertex->to_string(this).c_str());
-    visitor_->visit(vertex);
-    bkwd_iter_->enqueueAdjacentVertices(vertex);
-  }
-}
-
-bool
-PathGroupPathVisitor::visitFromToPath(const Pin *,
-				      Vertex *from_vertex,
-				      const RiseFall *,
-				      Tag *from_tag,
-				      Path *,
-                                      const Arrival &,
-				      Edge *,
-				      TimingArc *,
-				      ArcDelay ,
-				      Vertex *to_vertex,
-				      const RiseFall *to_rf,
-				      Tag *to_tag,
-				      Arrival &,
-				      const MinMax *,
-				      const PathAnalysisPt *path_ap)
-{
-  PathSet *matching_paths = matching_path_map_->findKey(to_vertex);
-  if (matching_paths) {
-    Path to_path(to_vertex, to_tag, this);
-    if (!to_path.isNull()) {
-      if (matching_paths->hasKey(&to_path)) {
-	debugPrint(debug_, "visit_path_group", 2, "match %s %s -> %s %s",
-                   from_vertex->to_string(this).c_str(),
-                   from_tag->to_string(this).c_str(),
-                   to_vertex->to_string(this).c_str(),
-                   to_tag->to_string(this).c_str());
-	fromMatches(from_vertex, from_tag);
-      }
-    }
-    else {
-      VertexPathIterator to_iter(to_vertex, to_rf, path_ap, this);
-      while (to_iter.hasNext()) {
-	Path *to_path = to_iter.next();
-	if (Tag::matchNoCrpr(to_path->tag(this), to_tag)
-	    && matching_paths->hasKey(to_path)) {
-	  debugPrint(debug_, "visit_path_group", 2, 
-                     "match crpr %s %s -> %s %s",
-                     from_vertex->to_string(this).c_str(),
-                     from_tag->to_string(this).c_str(),
-                     to_vertex->to_string(this).c_str(),
-                     to_tag->to_string(this).c_str());
-	  fromMatches(from_vertex, from_tag);
-	}
-      }
-    }
-  }
-  return true;
-}
-
-void
-PathGroupPathVisitor::fromMatches(Vertex *from_vertex,
-				  Tag *from_tag)
-{
-  vertex_matches_ = true;
-  vertexPathSetMapInsertPath(matching_path_map_, from_vertex,
-			     from_tag, this);
-}
-
-} // namespace
diff --git a/search/VisitPathGroupVertices.hh b/search/VisitPathGroupVertices.hh
deleted file mode 100644
index 55f585ef..00000000
--- a/search/VisitPathGroupVertices.hh
+++ /dev/null
@@ -1,40 +0,0 @@
-// OpenSTA, Static Timing Analyzer
-// Copyright (c) 2025, Parallax Software, Inc.
-// 
-// This program is free software: you can redistribute it and/or modify
-// it under the terms of the GNU General Public License as published by
-// the Free Software Foundation, either version 3 of the License, or
-// (at your option) any later version.
-// 
-// This program is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-// GNU General Public License for more details.
-// 
-// You should have received a copy of the GNU General Public License
-// along with this program. If not, see <https://www.gnu.org/licenses/>.
-// 
-// The origin of this software must not be misrepresented; you must not
-// claim that you wrote the original software.
-// 
-// Altered source versions must be plainly marked as such, and must not be
-// misrepresented as being the original software.
-// 
-// This notice may not be removed or altered from any source distribution.
-
-#pragma once
-
-namespace sta {
-
-class PathGroup;
-class VertexVisitor;
-class StaState;
-
-// Visit the fanin vertices for the path group.
-// Vertices in the clock network are NOT visited.
-void
-visitPathGroupVertices(PathGroup *path_group,
-		       VertexVisitor *visitor,
-		       StaState *sta);
-
-} // namespace