NFC: Rename DFS to depthFirstSeach

Author: xedin

Sources/Basics/Graph/GraphAlgorithms.swift

@@ -25,7 +25,7 @@ import struct OrderedCollections.OrderedSet
 ///
 /// - Complexity: O(v + e) where (v, e) are the number of vertices and edges
 /// reachable from the input nodes via the relation.
-public func DFS<T: Hashable>(
+public func depthFirstSearch<T: Hashable>(
     _ nodes: [T],
     successors: (T) throws -> [T],
     onUnique: (T) -> Void,
@@ -54,4 +54,4 @@ public func DFS<T: Hashable>(
             }
         }
     }
-}
+}

Sources/PackageGraph/ModulesGraph+Loading.swift

@@ -69,7 +69,7 @@ extension ModulesGraph {
         var allNodes = [GraphLoadingNode]()
 
         // Cycles in dependencies don't matter as long as there are no target cycles between packages.
-        DFS(inputManifests.map { KeyedPair($0, key: $0.id) }) {
+        depthFirstSearch(inputManifests.map { KeyedPair($0, key: $0.id) }) {
             $0.item.requiredDependencies.compactMap { dependency in
                 manifestMap[dependency.identity].map { (manifest, fileSystem) in
                     KeyedPair(

Sources/Workspace/Workspace+Manifests.swift

@@ -16,7 +16,7 @@ import struct Basics.InternalError
 import class Basics.ObservabilityScope
 import struct Basics.SwiftVersion
 import func Basics.temp_await
-import func Basics.DFS
+import func Basics.depthFirstSearch
 import class Basics.ThreadSafeKeyValueStore
 import class Dispatch.DispatchGroup
 import struct Dispatch.DispatchTime
@@ -533,7 +533,7 @@ extension Workspace {
             }
 
             var deduplication = [PackageIdentity: Int]()
-            try DFS(
+            try depthFirstSearch(
                 manifestGraphRoots,
                 successors: successorManifests
             ) { pair in