Swift Package Index

Build Information

Successful build of Graphs, reference main (dfa3cb), with Swift 6.0 for macOS (SPM) on 17 Dec 2024 03:31:44 UTC.

Swift 6 data race errors: 0

Build Command

env DEVELOPER_DIR=/Applications/Xcode-16.2.0.app xcrun swift build --arch arm64 -Xswiftc -Xfrontend -Xswiftc -stats-output-dir -Xswiftc -Xfrontend -Xswiftc .stats

Build Log

========================================
RunAll
========================================
Builder version: 4.59.0
Interrupt handler set up.
========================================
Checkout
========================================
Clone URL: https://github.com/tevelee/swift-graphs.git
Reference: main
Initialized empty Git repository in /Users/admin/builder/spi-builder-workspace/.git/
From https://github.com/tevelee/swift-graphs
 * branch            main       -> FETCH_HEAD
 * [new branch]      main       -> origin/main
HEAD is now at dfa3cb1 Separated shortest path until algorithm
Cloned https://github.com/tevelee/swift-graphs.git
Revision (git rev-parse @):
dfa3cb1a27dfc1e9a65e49f57f99eba62e3b9a54
SPI manifest file found: $PWD/.spi.yml
SUCCESS checkout https://github.com/tevelee/swift-graphs.git at main
Fetching https://github.com/apple/swift-collections.git
Fetching https://github.com/apple/swift-algorithms.git
[1/5591] Fetching swift-algorithms
[4027/21194] Fetching swift-algorithms, swift-collections
Fetched https://github.com/apple/swift-collections.git from cache (2.09s)
Fetched https://github.com/apple/swift-algorithms.git from cache (2.09s)
Computing version for https://github.com/apple/swift-algorithms.git
Computed https://github.com/apple/swift-algorithms.git at 1.2.0 (3.22s)
Fetching https://github.com/apple/swift-numerics.git
[1/5576] Fetching swift-numerics
Fetched https://github.com/apple/swift-numerics.git from cache (1.09s)
Computing version for https://github.com/apple/swift-numerics.git
Computed https://github.com/apple/swift-numerics.git at 1.0.2 (0.55s)
Computing version for https://github.com/apple/swift-collections.git
Computed https://github.com/apple/swift-collections.git at 1.1.4 (0.65s)
Creating working copy for https://github.com/apple/swift-algorithms.git
Working copy of https://github.com/apple/swift-algorithms.git resolved at 1.2.0
Creating working copy for https://github.com/apple/swift-numerics.git
Working copy of https://github.com/apple/swift-numerics.git resolved at 1.0.2
Creating working copy for https://github.com/apple/swift-collections.git
Working copy of https://github.com/apple/swift-collections.git resolved at 1.1.4
========================================
ResolveProductDependencies
========================================
Resolving dependencies ...
{
  "identity": ".resolve-product-dependencies",
  "name": "resolve-dependencies",
  "url": "/Users/admin/builder/spi-builder-workspace/.resolve-product-dependencies",
  "version": "unspecified",
  "path": "/Users/admin/builder/spi-builder-workspace/.resolve-product-dependencies",
  "dependencies": [
    {
      "identity": "swift-graphs",
      "name": "Graphs",
      "url": "https://github.com/tevelee/swift-graphs.git",
      "version": "unspecified",
      "path": "/Users/admin/builder/spi-builder-workspace/.resolve-product-dependencies/.build/checkouts/swift-graphs",
      "dependencies": [
        {
          "identity": "swift-collections",
          "name": "swift-collections",
          "url": "https://github.com/apple/swift-collections.git",
          "version": "1.1.4",
          "path": "/Users/admin/builder/spi-builder-workspace/.resolve-product-dependencies/.build/checkouts/swift-collections",
          "dependencies": [
          ]
        },
        {
          "identity": "swift-algorithms",
          "name": "swift-algorithms",
          "url": "https://github.com/apple/swift-algorithms.git",
          "version": "1.2.0",
          "path": "/Users/admin/builder/spi-builder-workspace/.resolve-product-dependencies/.build/checkouts/swift-algorithms",
          "dependencies": [
            {
              "identity": "swift-numerics",
              "name": "swift-numerics",
              "url": "https://github.com/apple/swift-numerics.git",
              "version": "1.0.2",
              "path": "/Users/admin/builder/spi-builder-workspace/.resolve-product-dependencies/.build/checkouts/swift-numerics",
              "dependencies": [
              ]
            }
          ]
        }
      ]
    }
  ]
}
Fetching https://github.com/tevelee/swift-graphs.git
[1/626] Fetching swift-graphs
Fetched https://github.com/tevelee/swift-graphs.git from cache (0.84s)
Fetching https://github.com/apple/swift-algorithms.git from cache
Fetching https://github.com/apple/swift-collections.git from cache
Fetched https://github.com/apple/swift-algorithms.git from cache (0.45s)
Fetched https://github.com/apple/swift-collections.git from cache (0.55s)
Computing version for https://github.com/apple/swift-algorithms.git
Computed https://github.com/apple/swift-algorithms.git at 1.2.0 (0.02s)
Fetching https://github.com/apple/swift-numerics.git from cache
Fetched https://github.com/apple/swift-numerics.git from cache (0.52s)
Computing version for https://github.com/apple/swift-numerics.git
Computed https://github.com/apple/swift-numerics.git at 1.0.2 (0.02s)
Computing version for https://github.com/apple/swift-collections.git
Computed https://github.com/apple/swift-collections.git at 1.1.4 (0.02s)
Creating working copy for https://github.com/apple/swift-algorithms.git
Working copy of https://github.com/apple/swift-algorithms.git resolved at 1.2.0
Creating working copy for https://github.com/apple/swift-numerics.git
Working copy of https://github.com/apple/swift-numerics.git resolved at 1.0.2
Creating working copy for https://github.com/apple/swift-collections.git
Working copy of https://github.com/apple/swift-collections.git resolved at 1.1.4
Creating working copy for https://github.com/tevelee/swift-graphs.git
Working copy of https://github.com/tevelee/swift-graphs.git resolved at main (dfa3cb1)
warning: '.resolve-product-dependencies': dependency 'swift-graphs' is not used by any target
Found 2 product dependencies
  - swift-collections
  - swift-algorithms
========================================
Build
========================================
Selected platform:         macosSpm
Swift version:             6.0
Building package at path:  $PWD
https://github.com/tevelee/swift-graphs.git
https://github.com/tevelee/swift-graphs.git
{
  "dependencies" : [
    {
      "identity" : "swift-collections",
      "requirement" : {
        "range" : [
          {
            "lower_bound" : "1.1.0",
            "upper_bound" : "2.0.0"
          }
        ]
      },
      "type" : "sourceControl",
      "url" : "https://github.com/apple/swift-collections.git"
    },
    {
      "identity" : "swift-algorithms",
      "requirement" : {
        "range" : [
          {
            "lower_bound" : "1.2.0",
            "upper_bound" : "2.0.0"
          }
        ]
      },
      "type" : "sourceControl",
      "url" : "https://github.com/apple/swift-algorithms.git"
    }
  ],
  "manifest_display_name" : "Graphs",
  "name" : "Graphs",
  "path" : "/Users/admin/builder/spi-builder-workspace",
  "platforms" : [
    {
      "name" : "ios",
      "version" : "13.0"
    },
    {
      "name" : "maccatalyst",
      "version" : "13.0"
    },
    {
      "name" : "macos",
      "version" : "10.15"
    },
    {
      "name" : "watchos",
      "version" : "6.0"
    },
    {
      "name" : "tvos",
      "version" : "13.0"
    },
    {
      "name" : "visionos",
      "version" : "1.0"
    }
  ],
  "products" : [
    {
      "name" : "Graphs",
      "targets" : [
        "Graphs"
      ],
      "type" : {
        "library" : [
          "automatic"
        ]
      }
    }
  ],
  "targets" : [
    {
      "c99name" : "GraphsTests",
      "module_type" : "SwiftTarget",
      "name" : "GraphsTests",
      "path" : "Tests/GraphsTests",
      "sources" : [
        "GraphTests.swift"
      ],
      "target_dependencies" : [
        "Graphs"
      ],
      "type" : "test"
    },
    {
      "c99name" : "Graphs",
      "module_type" : "SwiftTarget",
      "name" : "Graphs",
      "path" : "Sources/Graphs",
      "product_dependencies" : [
        "Collections",
        "Algorithms"
      ],
      "product_memberships" : [
        "Graphs"
      ],
      "sources" : [
        "Algorithms/Coloring/Graph+Coloring+DSatur.swift",
        "Algorithms/Coloring/Graph+Coloring+Greedy.swift",
        "Algorithms/Coloring/Graph+Coloring+WelshPowell.swift",
        "Algorithms/Coloring/Graph+Coloring.swift",
        "Algorithms/EulerianPath/Graph+EulerianPath+Backtracking.swift",
        "Algorithms/EulerianPath/Graph+EulerianPath+Hierholzer.swift",
        "Algorithms/EulerianPath/Graph+EulerianPath.swift",
        "Algorithms/HamiltonianPath/Graph+HamiltonianPath+Backtracking.swift",
        "Algorithms/HamiltonianPath/Graph+HamiltonianPath+Heuristic.swift",
        "Algorithms/HamiltonianPath/Graph+HamiltonianPath.swift",
        "Algorithms/Isomorphism/Graph+Isomophism+VF2.swift",
        "Algorithms/Isomorphism/Graph+Isomophism+WeisfeilerLehman.swift",
        "Algorithms/Isomorphism/Graph+Isomophism.swift",
        "Algorithms/Matching/MaximumMatchingAlgorithm+HopcroftKarp.swift",
        "Algorithms/Matching/MaximumMatchingAlgorithm.swift",
        "Algorithms/MaxFlow-MinCut/Graph+MaxFlow+Dinic.swift",
        "Algorithms/MaxFlow-MinCut/Graph+MaxFlow+EdmondsKarp.swift",
        "Algorithms/MaxFlow-MinCut/Graph+MaxFlow+FordFulkerson.swift",
        "Algorithms/MaxFlow-MinCut/Graph+MaxFlow.swift",
        "Algorithms/MinimumSpanningTree/Graph+MinimumSpanningTree+Boruvka.swift",
        "Algorithms/MinimumSpanningTree/Graph+MinimumSpanningTree+Kruskal.swift",
        "Algorithms/MinimumSpanningTree/Graph+MinimumSpanningTree+Prim.swift",
        "Algorithms/MinimumSpanningTree/Graph+MinimumSpanningTree.swift",
        "Algorithms/Random/ConnectedGraph+Random.swift",
        "Algorithms/Random/DisjointGraph+Random.swift",
        "Algorithms/Random/Graph+Random+BarabasiAlbert.swift",
        "Algorithms/Random/Graph+Random+ErdosRenyi.swift",
        "Algorithms/Random/Graph+Random+WattsStrogatz.swift",
        "Algorithms/Random/Graph+Random.swift",
        "Algorithms/ShortestPath/Graph+KShortestPaths+Yen.swift",
        "Algorithms/ShortestPath/Graph+KShortestPaths.swift",
        "Algorithms/ShortestPath/Graph+ShortestPathOnWholeGraph+BellmanFord.swift",
        "Algorithms/ShortestPath/Graph+ShortestPathOnWholeGraph+BidirectionalDijkstra.swift",
        "Algorithms/ShortestPath/Graph+ShortestPathOnWholeGraph.swift",
        "Algorithms/ShortestPath/Graph+ShortestPathsForAllPairs+FloydWarshall.swift",
        "Algorithms/ShortestPath/Graph+ShortestPathsForAllPairs+Johnson.swift",
        "Algorithms/ShortestPath/Graph+ShortestPathsForAllPairs.swift",
        "Algorithms/ShortestPath/Graph+ShortestPathsOnWholeGraph+BellmanFord.swift",
        "Algorithms/ShortestPath/Graph+ShortestPathsOnWholeGraph.swift",
        "Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift",
        "Algorithms/ShortestPath/GraphComponent+ShortestPath+AStar.swift",
        "Algorithms/ShortestPath/GraphComponent+ShortestPath+Dijkstra.swift",
        "Algorithms/ShortestPath/GraphComponent+ShortestPath.swift",
        "Algorithms/ShortestPath/GraphComponent+ShortestPathUntil+AStar.swift",
        "Algorithms/ShortestPath/GraphComponent+ShortestPathUntil+Dijkstra.swift",
        "Algorithms/ShortestPath/GraphComponent+ShortestPathUntil.swift",
        "Algorithms/ShortestPath/GraphComponent+ShortestPaths+Dijkstra.swift",
        "Algorithms/ShortestPath/GraphComponent+ShortestPaths.swift",
        "Algorithms/StronglyConnectedComponents/Graph+StronglyConnectedComponents+Kosaraju.swift",
        "Algorithms/StronglyConnectedComponents/Graph+StronglyConnectedComponents+Tarjan.swift",
        "Algorithms/StronglyConnectedComponents/Graph+StronglyConnectedComponents.swift",
        "Algorithms/Traversal/BinaryGraph+Search.swift",
        "Algorithms/Traversal/BinaryGraph+Traversal.swift",
        "Algorithms/Traversal/BinaryGraph+TraversalStrategy+DFS+Inorder.swift",
        "Algorithms/Traversal/BinaryGraph+TraversalStrategy.swift",
        "Algorithms/Traversal/Graph+Search.swift",
        "Algorithms/Traversal/Graph+Traversal.swift",
        "Algorithms/Traversal/Graph+TraversalStrategy+Acyclic.swift",
        "Algorithms/Traversal/Graph+TraversalStrategy+BFS.swift",
        "Algorithms/Traversal/Graph+TraversalStrategy+DFS+Postorder.swift",
        "Algorithms/Traversal/Graph+TraversalStrategy+DFS+Preorder.swift",
        "Algorithms/Traversal/Graph+TraversalStrategy+DFS.swift",
        "Algorithms/Traversal/Graph+TraversalStrategy+IterativelyDeepeningDFS.swift",
        "Algorithms/Traversal/Graph+TraversalStrategy+Limited.swift",
        "Algorithms/Traversal/Graph+TraversalStrategy+Priority.swift",
        "Algorithms/Traversal/Graph+TraversalStrategy+Unique.swift",
        "Algorithms/Traversal/Graph+TraversalStrategy.swift",
        "Algorithms/Visit/Graph+Visitor+AncestorTracking.swift",
        "Algorithms/Visit/Graph+Visitor+DepthTracking.swift",
        "Algorithms/Visit/Graph+Visitor+NodesTracking.swift",
        "Algorithms/Visit/Graph+Visitor+PathTracking.swift",
        "Algorithms/Visit/Graph+Visitor.swift",
        "BinaryGraph.swift",
        "BipartiteGraph.swift",
        "Concrete graphs/ConnectedBinaryGraph.swift",
        "Concrete graphs/ConnectedBinaryHashGraph.swift",
        "Concrete graphs/ConnectedGraph.swift",
        "Concrete graphs/ConnectedHashGraph.swift",
        "Concrete graphs/DisjointBinaryGraph.swift",
        "Concrete graphs/DisjointBinaryHashGraph.swift",
        "Concrete graphs/DisjointGraph.swift",
        "Concrete graphs/DisjointHashGraph.swift",
        "Concrete graphs/GridGraph.swift",
        "Concrete graphs/LazyBinaryGraph.swift",
        "Concrete graphs/LazyGraph.swift",
        "Concrete graphs/Transformations/ComplementGraph.swift",
        "Concrete graphs/Transformations/Graph+Equatable.swift",
        "Concrete graphs/Transformations/Graph+Hashable.swift",
        "Concrete graphs/Transformations/PartitionedGraph.swift",
        "Concrete graphs/Transformations/ResidualGraph.swift",
        "Concrete graphs/Transformations/TransposedGraph.swift",
        "Concrete graphs/Transformations/UndirectedGraph.swift",
        "Concrete graphs/WeightedGraph.swift",
        "Distance.swift",
        "Graph+Properties.swift",
        "Graph.swift",
        "GraphComponent.swift",
        "MutableGraph.swift",
        "Utils.swift",
        "Weighted.swift"
      ],
      "type" : "library"
    }
  ],
  "tools_version" : "6.0"
}
Running build ...
env DEVELOPER_DIR=/Applications/Xcode-16.2.0.app xcrun swift build --arch arm64 -Xswiftc -Xfrontend -Xswiftc -stats-output-dir -Xswiftc -Xfrontend -Xswiftc .stats
Building for debugging...
[0/13] Write sources
[11/13] Compiling _NumericsShims _NumericsShims.c
[12/13] Write swift-version-5BDAB9E9C0126B9D.txt
[14/41] Compiling RealModule Real.swift
[15/42] Compiling InternalCollectionsUtilities RandomAccessCollection+Offsets.swift
[16/42] Compiling InternalCollectionsUtilities Specialize.swift
[17/42] Compiling InternalCollectionsUtilities UnsafeBufferPointer+Extras.swift
[18/43] Compiling RealModule RealFunctions.swift
[19/43] Compiling InternalCollectionsUtilities _SortedCollection.swift
[20/43] Compiling InternalCollectionsUtilities _UniqueCollection.swift
[21/43] Compiling InternalCollectionsUtilities Debugging.swift
[22/43] Compiling InternalCollectionsUtilities Descriptions.swift
[23/43] Compiling RealModule ApproximateEquality.swift
[24/43] Emitting module RealModule
[25/43] Compiling InternalCollectionsUtilities UnsafeMutableBufferPointer+Extras.swift
[26/43] Compiling RealModule Float80+Real.swift
[27/43] Compiling RealModule ElementaryFunctions.swift
[28/43] Compiling RealModule Float+Real.swift
[29/43] Compiling RealModule AugmentedArithmetic.swift
[30/43] Compiling RealModule Double+Real.swift
[31/43] Compiling RealModule AlgebraicField.swift
[32/43] Compiling RealModule Float16+Real.swift
[33/43] Compiling InternalCollectionsUtilities Integer rank.swift
[34/43] Compiling InternalCollectionsUtilities UInt+first and last set bit.swift
[35/43] Compiling InternalCollectionsUtilities UInt+reversed.swift
[36/43] Compiling InternalCollectionsUtilities _UnsafeBitSet+Index.swift
[37/43] Compiling InternalCollectionsUtilities UnsafeMutableBufferPointer+SE-0370.swift
[38/43] Compiling InternalCollectionsUtilities UnsafeMutablePointer+SE-0370.swift
[39/43] Compiling InternalCollectionsUtilities UnsafeRawPointer extensions.swift
[40/43] Compiling InternalCollectionsUtilities FixedWidthInteger+roundUpToPowerOfTwo.swift
[41/43] Emitting module InternalCollectionsUtilities
[42/43] Compiling InternalCollectionsUtilities _UnsafeBitSet+_Word.swift
[43/43] Compiling InternalCollectionsUtilities _UnsafeBitSet.swift
[44/351] Compiling HashTreeCollections TreeDictionary+MapValues.swift
[45/351] Compiling HashTreeCollections TreeDictionary+Merge.swift
[46/353] Compiling HashTreeCollections _Bucket.swift
[47/353] Compiling HashTreeCollections _Hash.swift
[48/354] Compiling DequeModule _DequeBuffer.swift
[49/354] Compiling DequeModule _DequeBufferHeader.swift
[50/354] Compiling DequeModule _DequeSlot.swift
[51/354] Compiling HeapModule _HeapNode.swift
[52/354] Compiling HeapModule Heap.swift
[53/354] Compiling HeapModule Heap+Invariants.swift
[54/354] Compiling HeapModule Heap+ExpressibleByArrayLiteral.swift
[55/354] Compiling HeapModule Heap+Descriptions.swift
[56/354] Compiling HeapModule Heap+UnsafeHandle.swift
[57/354] Compiling HashTreeCollections _HashNode+Debugging.swift
[58/354] Compiling HashTreeCollections _HashNode+Initializers.swift
[59/354] Compiling HashTreeCollections _HashLevel.swift
[60/354] Compiling HashTreeCollections _HashNode+Builder.swift
[61/354] Compiling HashTreeCollections _HashNode+Subtree Removals.swift
[62/354] Compiling HashTreeCollections _HashNode+UnsafeHandle.swift
[63/354] Compiling HashTreeCollections _HashNode.swift
[64/354] Compiling HashTreeCollections _HashNodeHeader.swift
[65/354] Compiling HashTreeCollections _HashSlot.swift
[66/354] Compiling HashTreeCollections _HashStack.swift
[67/354] Compiling HashTreeCollections TreeDictionary+Codable.swift
[68/354] Compiling HashTreeCollections TreeDictionary+Collection.swift
[69/354] Compiling HashTreeCollections TreeDictionary+CustomReflectable.swift
[70/354] Compiling HashTreeCollections TreeDictionary+Debugging.swift
[71/354] Compiling HashTreeCollections TreeDictionary+Descriptions.swift
[72/354] Compiling HashTreeCollections TreeDictionary+Equatable.swift
[73/360] Compiling DequeModule _UnsafeWrappedBuffer.swift
[75/360] Compiling HashTreeCollections _HashTreeIterator.swift
[76/360] Compiling HashTreeCollections _HashTreeStatistics.swift
[77/360] Compiling HashTreeCollections _RawHashNode+UnsafeHandle.swift
[78/360] Compiling HashTreeCollections TreeSet+SetAlgebra basics.swift
[79/360] Compiling HashTreeCollections TreeSet+SetAlgebra formIntersection.swift
[80/365] Compiling HashTreeCollections _UnsafePath.swift
[97/365] Compiling BitCollections BitSet.swift
[98/365] Emitting module HeapModule
[99/365] Compiling Algorithms Unique.swift
[100/365] Compiling Algorithms Windows.swift
[101/365] Compiling HashTreeCollections _HashNode+Invariants.swift
[102/365] Compiling HashTreeCollections _HashNode+Lookups.swift
[103/365] Compiling HashTreeCollections _HashNode+Primitive Insertions.swift
[104/365] Compiling HashTreeCollections _HashNode+Primitive Removals.swift
[113/365] Compiling HashTreeCollections _HashNode+Primitive Replacement.swift
[114/365] Compiling HashTreeCollections TreeSet+CustomReflectable.swift
[115/365] Compiling HashTreeCollections TreeSet+Debugging.swift
[116/365] Compiling HashTreeCollections TreeSet+Descriptions.swift
[117/365] Compiling HashTreeCollections _RawHashNode.swift
[118/365] Compiling HashTreeCollections _UnmanagedHashNode.swift
[122/365] Compiling HashTreeCollections TreeDictionary+Values.swift
[123/365] Compiling HashTreeCollections TreeDictionary.swift
[124/365] Compiling HashTreeCollections TreeSet+Codable.swift
[125/365] Compiling HashTreeCollections TreeSet+Collection.swift
[126/365] Compiling HashTreeCollections TreeDictionary+ExpressibleByDictionaryLiteral.swift
[127/365] Compiling HashTreeCollections TreeDictionary+Filter.swift
[128/365] Compiling HashTreeCollections TreeDictionary+Hashable.swift
[129/365] Compiling HashTreeCollections TreeDictionary+Initializers.swift
[130/365] Compiling HashTreeCollections TreeDictionary+Keys.swift
[132/365] Compiling BitCollections Range+Utilities.swift
[133/365] Compiling BitCollections Slice+Utilities.swift
[134/365] Compiling BitCollections UInt+Tricks.swift
[135/365] Compiling BitCollections _Word.swift
[136/365] Compiling HashTreeCollections _AncestorHashSlots.swift
[137/365] Compiling HashTreeCollections _Bitmap.swift
[145/365] Compiling HashTreeCollections _HashNode+Storage.swift
[146/365] Compiling HashTreeCollections _HashNode+Structural compactMapValues.swift
[147/365] Compiling HashTreeCollections _HashNode+Structural filter.swift
[148/365] Compiling HashTreeCollections _HashNode+Structural intersection.swift
[149/365] Compiling HashTreeCollections _HashNode+Structural isDisjoint.swift
[183/372] Compiling HashTreeCollections _HashNode+Structural isSubset.swift
[184/372] Compiling HashTreeCollections _HashNode+Structural mapValues.swift
[185/372] Compiling HashTreeCollections _HashNode+Structural merge.swift
[186/372] Compiling HashTreeCollections _HashNode+Structural subtracting.swift
[187/372] Compiling _RopeModule BigString+Comparable.swift
[188/372] Compiling HashTreeCollections _HashNode+Structural union.swift
[189/372] Compiling HashTreeCollections _HashNode+Subtree Insertions.swift
[190/372] Compiling _RopeModule BigString+Equatable.swift
[228/372] Emitting module BitCollections
[235/372] Compiling OrderedCollections OrderedSet.swift
[236/372] Compiling OrderedCollections _UnsafeBitset.swift
[270/380] Emitting module DequeModule
[298/380] Compiling HashTreeCollections TreeSet+SetAlgebra isStrictSuperset.swift
[299/380] Compiling HashTreeCollections TreeSet+SetAlgebra isSubset.swift
[300/380] Compiling HashTreeCollections TreeSet+SetAlgebra isSuperset.swift
[301/380] Compiling HashTreeCollections TreeSet+SetAlgebra subtract.swift
[302/380] Compiling HashTreeCollections TreeSet+SetAlgebra subtracting.swift
[303/380] Compiling HashTreeCollections TreeSet+SetAlgebra symmetricDifference.swift
[304/380] Compiling HashTreeCollections TreeSet+SetAlgebra union.swift
[305/380] Compiling HashTreeCollections TreeSet.swift
[321/380] Compiling _RopeModule Rope+Remove.swift
[322/380] Compiling _RopeModule Rope+RemoveSubrange.swift
[323/380] Compiling _RopeModule Rope+Split.swift
[324/380] Compiling _RopeModule Optional Utilities.swift
[325/380] Compiling _RopeModule String Utilities.swift
[326/380] Compiling _RopeModule String.Index+ABI.swift
[327/380] Compiling _RopeModule _CharacterRecognizer.swift
[328/380] Compiling HashTreeCollections TreeSet+SetAlgebra Initializers.swift
[377/380] Emitting module OrderedCollections
[378/380] Emitting module _RopeModule
[379/380] Emitting module Algorithms
[380/380] Emitting module HashTreeCollections
[381/382] Compiling Collections Collections.swift
[382/382] Emitting module Collections
[383/473] Compiling Graphs Graph+StronglyConnectedComponents.swift
[384/473] Compiling Graphs BinaryGraph+Search.swift
[385/473] Compiling Graphs BinaryGraph+Traversal.swift
[386/473] Compiling Graphs BinaryGraph+TraversalStrategy+DFS+Inorder.swift
[387/473] Compiling Graphs BinaryGraph+TraversalStrategy.swift
[388/473] Compiling Graphs Graph+Search.swift
[389/473] Compiling Graphs Graph+Traversal.swift
[390/473] Compiling Graphs Graph+TraversalStrategy+Acyclic.swift
[391/473] Compiling Graphs Graph+TraversalStrategy+BFS.swift
[392/473] Compiling Graphs Graph+TraversalStrategy+DFS+Postorder.swift
[393/483] Compiling Graphs Graph+TraversalStrategy+DFS+Preorder.swift
[394/483] Compiling Graphs Graph+TraversalStrategy+DFS.swift
[395/483] Compiling Graphs Graph+TraversalStrategy+IterativelyDeepeningDFS.swift
[396/483] Compiling Graphs Graph+TraversalStrategy+Limited.swift
[397/483] Compiling Graphs Graph+TraversalStrategy+Priority.swift
[398/483] Compiling Graphs Graph+TraversalStrategy+Unique.swift
[399/483] Compiling Graphs Graph+TraversalStrategy.swift
[400/483] Compiling Graphs Graph+Visitor+AncestorTracking.swift
[401/483] Compiling Graphs Graph+Visitor+DepthTracking.swift
[402/483] Compiling Graphs Graph+Visitor+NodesTracking.swift
[403/483] Compiling Graphs GraphComponent+ShortestPath+AStar.swift
[404/483] Compiling Graphs GraphComponent+ShortestPath+Dijkstra.swift
[405/483] Compiling Graphs GraphComponent+ShortestPath.swift
[406/483] Compiling Graphs GraphComponent+ShortestPathUntil+AStar.swift
[407/483] Compiling Graphs GraphComponent+ShortestPathUntil+Dijkstra.swift
[408/483] Compiling Graphs GraphComponent+ShortestPathUntil.swift
[409/483] Compiling Graphs GraphComponent+ShortestPaths+Dijkstra.swift
[410/483] Compiling Graphs GraphComponent+ShortestPaths.swift
[411/483] Compiling Graphs Graph+StronglyConnectedComponents+Kosaraju.swift
[412/483] Compiling Graphs Graph+StronglyConnectedComponents+Tarjan.swift
[413/483] Compiling Graphs Graph+Isomophism+VF2.swift
[414/483] Compiling Graphs Graph+Isomophism+WeisfeilerLehman.swift
[415/483] Compiling Graphs Graph+Isomophism.swift
[416/483] Compiling Graphs MaximumMatchingAlgorithm+HopcroftKarp.swift
[417/483] Compiling Graphs MaximumMatchingAlgorithm.swift
[418/483] Compiling Graphs Graph+MaxFlow+Dinic.swift
[419/483] Compiling Graphs Graph+MaxFlow+EdmondsKarp.swift
[420/483] Compiling Graphs Graph+MaxFlow+FordFulkerson.swift
[421/483] Compiling Graphs Graph+MaxFlow.swift
[422/483] Compiling Graphs Graph+MinimumSpanningTree+Boruvka.swift
[423/483] Compiling Graphs Graph+KShortestPaths.swift
[424/483] Compiling Graphs Graph+ShortestPathOnWholeGraph+BellmanFord.swift
[425/483] Compiling Graphs Graph+ShortestPathOnWholeGraph+BidirectionalDijkstra.swift
[426/483] Compiling Graphs Graph+ShortestPathOnWholeGraph.swift
[427/483] Compiling Graphs Graph+ShortestPathsForAllPairs+FloydWarshall.swift
[428/483] Compiling Graphs Graph+ShortestPathsForAllPairs+Johnson.swift
[429/483] Compiling Graphs Graph+ShortestPathsForAllPairs.swift
[430/483] Compiling Graphs Graph+ShortestPathsOnWholeGraph+BellmanFord.swift
[431/483] Compiling Graphs Graph+ShortestPathsOnWholeGraph.swift
[432/483] Compiling Graphs GraphComponent+AllShortestPaths.swift
[433/483] Compiling Graphs Graph+MinimumSpanningTree+Kruskal.swift
[434/483] Compiling Graphs Graph+MinimumSpanningTree+Prim.swift
[435/483] Compiling Graphs Graph+MinimumSpanningTree.swift
[436/483] Compiling Graphs ConnectedGraph+Random.swift
[437/483] Compiling Graphs DisjointGraph+Random.swift
[438/483] Compiling Graphs Graph+Random+BarabasiAlbert.swift
[439/483] Compiling Graphs Graph+Random+ErdosRenyi.swift
[440/483] Compiling Graphs Graph+Random+WattsStrogatz.swift
[441/483] Compiling Graphs Graph+Random.swift
[442/483] Compiling Graphs Graph+KShortestPaths+Yen.swift
[443/483] Compiling Graphs Graph+Coloring+DSatur.swift
[444/483] Compiling Graphs Graph+Coloring+Greedy.swift
[445/483] Compiling Graphs Graph+Coloring+WelshPowell.swift
[446/483] Compiling Graphs Graph+Coloring.swift
[447/483] Compiling Graphs Graph+EulerianPath+Backtracking.swift
[448/483] Compiling Graphs Graph+EulerianPath+Hierholzer.swift
[449/483] Compiling Graphs Graph+EulerianPath.swift
[450/483] Compiling Graphs Graph+HamiltonianPath+Backtracking.swift
[451/483] Compiling Graphs Graph+HamiltonianPath+Heuristic.swift
[452/483] Compiling Graphs Graph+HamiltonianPath.swift
[453/483] Compiling Graphs DisjointGraph.swift
[454/483] Compiling Graphs DisjointHashGraph.swift
[455/483] Compiling Graphs GridGraph.swift
[456/483] Compiling Graphs LazyBinaryGraph.swift
[457/483] Compiling Graphs LazyGraph.swift
[458/483] Compiling Graphs ComplementGraph.swift
[459/483] Compiling Graphs Graph+Equatable.swift
[460/483] Compiling Graphs Graph+Hashable.swift
[461/483] Compiling Graphs PartitionedGraph.swift
[462/483] Compiling Graphs ResidualGraph.swift
[463/483] Compiling Graphs Graph+Visitor+PathTracking.swift
[464/483] Compiling Graphs Graph+Visitor.swift
[465/483] Compiling Graphs BinaryGraph.swift
[466/483] Compiling Graphs BipartiteGraph.swift
[467/483] Compiling Graphs ConnectedBinaryGraph.swift
[468/483] Compiling Graphs ConnectedBinaryHashGraph.swift
[469/483] Compiling Graphs ConnectedGraph.swift
[470/483] Compiling Graphs ConnectedHashGraph.swift
[471/483] Compiling Graphs DisjointBinaryGraph.swift
[472/483] Compiling Graphs DisjointBinaryHashGraph.swift
[473/483] Compiling Graphs TransposedGraph.swift
[474/483] Compiling Graphs UndirectedGraph.swift
[475/483] Compiling Graphs WeightedGraph.swift
[476/483] Compiling Graphs Distance.swift
[477/483] Compiling Graphs Graph+Properties.swift
[478/483] Compiling Graphs Graph.swift
[479/483] Compiling Graphs GraphComponent.swift
[480/483] Compiling Graphs MutableGraph.swift
[481/483] Compiling Graphs Utils.swift
[482/483] Compiling Graphs Weighted.swift
[483/483] Emitting module Graphs
Build complete! (29.51s)
warning: 'swift-algorithms': found 1 file(s) which are unhandled; explicitly declare them as resources or exclude from the target
    /Users/admin/builder/spi-builder-workspace/.build/checkouts/swift-algorithms/Sources/Algorithms/Documentation.docc
Build complete.
{
  "dependencies" : [
    {
      "identity" : "swift-collections",
      "requirement" : {
        "range" : [
          {
            "lower_bound" : "1.1.0",
            "upper_bound" : "2.0.0"
          }
        ]
      },
      "type" : "sourceControl",
      "url" : "https://github.com/apple/swift-collections.git"
    },
    {
      "identity" : "swift-algorithms",
      "requirement" : {
        "range" : [
          {
            "lower_bound" : "1.2.0",
            "upper_bound" : "2.0.0"
          }
        ]
      },
      "type" : "sourceControl",
      "url" : "https://github.com/apple/swift-algorithms.git"
    }
  ],
  "manifest_display_name" : "Graphs",
  "name" : "Graphs",
  "path" : "/Users/admin/builder/spi-builder-workspace",
  "platforms" : [
    {
      "name" : "ios",
      "version" : "13.0"
    },
    {
      "name" : "maccatalyst",
      "version" : "13.0"
    },
    {
      "name" : "macos",
      "version" : "10.15"
    },
    {
      "name" : "watchos",
      "version" : "6.0"
    },
    {
      "name" : "tvos",
      "version" : "13.0"
    },
    {
      "name" : "visionos",
      "version" : "1.0"
    }
  ],
  "products" : [
    {
      "name" : "Graphs",
      "targets" : [
        "Graphs"
      ],
      "type" : {
        "library" : [
          "automatic"
        ]
      }
    }
  ],
  "targets" : [
    {
      "c99name" : "GraphsTests",
      "module_type" : "SwiftTarget",
      "name" : "GraphsTests",
      "path" : "Tests/GraphsTests",
      "sources" : [
        "GraphTests.swift"
      ],
      "target_dependencies" : [
        "Graphs"
      ],
      "type" : "test"
    },
    {
      "c99name" : "Graphs",
      "module_type" : "SwiftTarget",
      "name" : "Graphs",
      "path" : "Sources/Graphs",
      "product_dependencies" : [
        "Collections",
        "Algorithms"
      ],
      "product_memberships" : [
        "Graphs"
      ],
      "sources" : [
        "Algorithms/Coloring/Graph+Coloring+DSatur.swift",
        "Algorithms/Coloring/Graph+Coloring+Greedy.swift",
        "Algorithms/Coloring/Graph+Coloring+WelshPowell.swift",
        "Algorithms/Coloring/Graph+Coloring.swift",
        "Algorithms/EulerianPath/Graph+EulerianPath+Backtracking.swift",
        "Algorithms/EulerianPath/Graph+EulerianPath+Hierholzer.swift",
        "Algorithms/EulerianPath/Graph+EulerianPath.swift",
        "Algorithms/HamiltonianPath/Graph+HamiltonianPath+Backtracking.swift",
        "Algorithms/HamiltonianPath/Graph+HamiltonianPath+Heuristic.swift",
        "Algorithms/HamiltonianPath/Graph+HamiltonianPath.swift",
        "Algorithms/Isomorphism/Graph+Isomophism+VF2.swift",
        "Algorithms/Isomorphism/Graph+Isomophism+WeisfeilerLehman.swift",
        "Algorithms/Isomorphism/Graph+Isomophism.swift",
        "Algorithms/Matching/MaximumMatchingAlgorithm+HopcroftKarp.swift",
        "Algorithms/Matching/MaximumMatchingAlgorithm.swift",
        "Algorithms/MaxFlow-MinCut/Graph+MaxFlow+Dinic.swift",
        "Algorithms/MaxFlow-MinCut/Graph+MaxFlow+EdmondsKarp.swift",
        "Algorithms/MaxFlow-MinCut/Graph+MaxFlow+FordFulkerson.swift",
        "Algorithms/MaxFlow-MinCut/Graph+MaxFlow.swift",
        "Algorithms/MinimumSpanningTree/Graph+MinimumSpanningTree+Boruvka.swift",
        "Algorithms/MinimumSpanningTree/Graph+MinimumSpanningTree+Kruskal.swift",
        "Algorithms/MinimumSpanningTree/Graph+MinimumSpanningTree+Prim.swift",
        "Algorithms/MinimumSpanningTree/Graph+MinimumSpanningTree.swift",
        "Algorithms/Random/ConnectedGraph+Random.swift",
        "Algorithms/Random/DisjointGraph+Random.swift",
        "Algorithms/Random/Graph+Random+BarabasiAlbert.swift",
        "Algorithms/Random/Graph+Random+ErdosRenyi.swift",
        "Algorithms/Random/Graph+Random+WattsStrogatz.swift",
        "Algorithms/Random/Graph+Random.swift",
        "Algorithms/ShortestPath/Graph+KShortestPaths+Yen.swift",
        "Algorithms/ShortestPath/Graph+KShortestPaths.swift",
        "Algorithms/ShortestPath/Graph+ShortestPathOnWholeGraph+BellmanFord.swift",
        "Algorithms/ShortestPath/Graph+ShortestPathOnWholeGraph+BidirectionalDijkstra.swift",
        "Algorithms/ShortestPath/Graph+ShortestPathOnWholeGraph.swift",
        "Algorithms/ShortestPath/Graph+ShortestPathsForAllPairs+FloydWarshall.swift",
        "Algorithms/ShortestPath/Graph+ShortestPathsForAllPairs+Johnson.swift",
        "Algorithms/ShortestPath/Graph+ShortestPathsForAllPairs.swift",
        "Algorithms/ShortestPath/Graph+ShortestPathsOnWholeGraph+BellmanFord.swift",
        "Algorithms/ShortestPath/Graph+ShortestPathsOnWholeGraph.swift",
        "Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift",
        "Algorithms/ShortestPath/GraphComponent+ShortestPath+AStar.swift",
        "Algorithms/ShortestPath/GraphComponent+ShortestPath+Dijkstra.swift",
        "Algorithms/ShortestPath/GraphComponent+ShortestPath.swift",
        "Algorithms/ShortestPath/GraphComponent+ShortestPathUntil+AStar.swift",
        "Algorithms/ShortestPath/GraphComponent+ShortestPathUntil+Dijkstra.swift",
        "Algorithms/ShortestPath/GraphComponent+ShortestPathUntil.swift",
        "Algorithms/ShortestPath/GraphComponent+ShortestPaths+Dijkstra.swift",
        "Algorithms/ShortestPath/GraphComponent+ShortestPaths.swift",
        "Algorithms/StronglyConnectedComponents/Graph+StronglyConnectedComponents+Kosaraju.swift",
        "Algorithms/StronglyConnectedComponents/Graph+StronglyConnectedComponents+Tarjan.swift",
        "Algorithms/StronglyConnectedComponents/Graph+StronglyConnectedComponents.swift",
        "Algorithms/Traversal/BinaryGraph+Search.swift",
        "Algorithms/Traversal/BinaryGraph+Traversal.swift",
        "Algorithms/Traversal/BinaryGraph+TraversalStrategy+DFS+Inorder.swift",
        "Algorithms/Traversal/BinaryGraph+TraversalStrategy.swift",
        "Algorithms/Traversal/Graph+Search.swift",
        "Algorithms/Traversal/Graph+Traversal.swift",
        "Algorithms/Traversal/Graph+TraversalStrategy+Acyclic.swift",
        "Algorithms/Traversal/Graph+TraversalStrategy+BFS.swift",
        "Algorithms/Traversal/Graph+TraversalStrategy+DFS+Postorder.swift",
        "Algorithms/Traversal/Graph+TraversalStrategy+DFS+Preorder.swift",
        "Algorithms/Traversal/Graph+TraversalStrategy+DFS.swift",
        "Algorithms/Traversal/Graph+TraversalStrategy+IterativelyDeepeningDFS.swift",
        "Algorithms/Traversal/Graph+TraversalStrategy+Limited.swift",
        "Algorithms/Traversal/Graph+TraversalStrategy+Priority.swift",
        "Algorithms/Traversal/Graph+TraversalStrategy+Unique.swift",
        "Algorithms/Traversal/Graph+TraversalStrategy.swift",
        "Algorithms/Visit/Graph+Visitor+AncestorTracking.swift",
        "Algorithms/Visit/Graph+Visitor+DepthTracking.swift",
        "Algorithms/Visit/Graph+Visitor+NodesTracking.swift",
        "Algorithms/Visit/Graph+Visitor+PathTracking.swift",
        "Algorithms/Visit/Graph+Visitor.swift",
        "BinaryGraph.swift",
        "BipartiteGraph.swift",
        "Concrete graphs/ConnectedBinaryGraph.swift",
        "Concrete graphs/ConnectedBinaryHashGraph.swift",
        "Concrete graphs/ConnectedGraph.swift",
        "Concrete graphs/ConnectedHashGraph.swift",
        "Concrete graphs/DisjointBinaryGraph.swift",
        "Concrete graphs/DisjointBinaryHashGraph.swift",
        "Concrete graphs/DisjointGraph.swift",
        "Concrete graphs/DisjointHashGraph.swift",
        "Concrete graphs/GridGraph.swift",
        "Concrete graphs/LazyBinaryGraph.swift",
        "Concrete graphs/LazyGraph.swift",
        "Concrete graphs/Transformations/ComplementGraph.swift",
        "Concrete graphs/Transformations/Graph+Equatable.swift",
        "Concrete graphs/Transformations/Graph+Hashable.swift",
        "Concrete graphs/Transformations/PartitionedGraph.swift",
        "Concrete graphs/Transformations/ResidualGraph.swift",
        "Concrete graphs/Transformations/TransposedGraph.swift",
        "Concrete graphs/Transformations/UndirectedGraph.swift",
        "Concrete graphs/WeightedGraph.swift",
        "Distance.swift",
        "Graph+Properties.swift",
        "Graph.swift",
        "GraphComponent.swift",
        "MutableGraph.swift",
        "Utils.swift",
        "Weighted.swift"
      ],
      "type" : "library"
    }
  ],
  "tools_version" : "6.0"
}
✅  Doc result (pending) reported
========================================
GenerateDocs
========================================
Generating docs at path:  $PWD/.docs/tevelee/swift-graphs/main
Repository:               tevelee/swift-graphs
Swift version used:       6.0
Target:                   Graphs
Extracting symbol information for 'Graphs'...
Finished extracting symbol information for 'Graphs'. (4.96s)
Building documentation for 'Graphs'...
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:32:21-32:32
30 |     /// Computes all shortest paths from the source node to the destination node in the graph.
31 |     /// - Parameter source: The starting node.
32 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
33 |     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:32:21-32:32
30 |     /// Computes all shortest paths from the source node to the destination node in the graph.
31 |     /// - Parameter source: The starting node.
32 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
33 |     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:32:21-32:32
30 |     /// Computes all shortest paths from the source node to the destination node in the graph.
31 |     /// - Parameter source: The starting node.
32 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
33 |     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:32:21-32:32
30 |     /// Computes all shortest paths from the source node to the destination node in the graph.
31 |     /// - Parameter source: The starting node.
32 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
33 |     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:32:21-32:32
30 |     /// Computes all shortest paths from the source node to the destination node in the graph.
31 |     /// - Parameter source: The starting node.
32 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
33 |     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:32:21-32:32
30 |     /// Computes all shortest paths from the source node to the destination node in the graph.
31 |     /// - Parameter source: The starting node.
32 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
33 |     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:32:21-32:32
30 |     /// Computes all shortest paths from the source node to the destination node in the graph.
31 |     /// - Parameter source: The starting node.
32 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
33 |     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:32:21-32:32
30 |     /// Computes all shortest paths from the source node to the destination node in the graph.
31 |     /// - Parameter source: The starting node.
32 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
33 |     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:32:21-32:32
30 |     /// Computes all shortest paths from the source node to the destination node in the graph.
31 |     /// - Parameter source: The starting node.
32 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
33 |     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:32:21-32:32
30 |     /// Computes all shortest paths from the source node to the destination node in the graph.
31 |     /// - Parameter source: The starting node.
32 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
33 |     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:32:21-32:32
30 |     /// Computes all shortest paths from the source node to the destination node in the graph.
31 |     /// - Parameter source: The starting node.
32 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
33 |     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:32:21-32:32
30 |     /// Computes all shortest paths from the source node to the destination node in the graph.
31 |     /// - Parameter source: The starting node.
32 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
33 |     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:32:21-32:32
30 |     /// Computes all shortest paths from the source node to the destination node in the graph.
31 |     /// - Parameter source: The starting node.
32 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
33 |     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:32:21-32:32
30 |     /// Computes all shortest paths from the source node to the destination node in the graph.
31 |     /// - Parameter source: The starting node.
32 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
33 |     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:32:21-32:32
30 |     /// Computes all shortest paths from the source node to the destination node in the graph.
31 |     /// - Parameter source: The starting node.
32 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
33 |     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:32:21-32:32
30 |     /// Computes all shortest paths from the source node to the destination node in the graph.
31 |     /// - Parameter source: The starting node.
32 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
33 |     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:32:21-32:32
30 |     /// Computes all shortest paths from the source node to the destination node in the graph.
31 |     /// - Parameter source: The starting node.
32 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
33 |     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:32:21-32:32
30 |     /// Computes all shortest paths from the source node to the destination node in the graph.
31 |     /// - Parameter source: The starting node.
32 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
33 |     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:32:21-32:32
30 |     /// Computes all shortest paths from the source node to the destination node in the graph.
31 |     /// - Parameter source: The starting node.
32 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
33 |     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:32:21-32:32
30 |     /// Computes all shortest paths from the source node to the destination node in the graph.
31 |     /// - Parameter source: The starting node.
32 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
33 |     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:33:83-33:83
31 |     /// - Parameter source: The starting node.
32 |     /// - Parameter destination: The destination node.
33 +     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
   |         ╰─suggestion: Document 'destiation' parameter
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
35 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:33:83-33:83
31 |     /// - Parameter source: The starting node.
32 |     /// - Parameter destination: The destination node.
33 +     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
   |         ╰─suggestion: Document 'destiation' parameter
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
35 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:33:83-33:83
31 |     /// - Parameter source: The starting node.
32 |     /// - Parameter destination: The destination node.
33 +     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
   |         ╰─suggestion: Document 'destiation' parameter
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
35 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:33:83-33:83
31 |     /// - Parameter source: The starting node.
32 |     /// - Parameter destination: The destination node.
33 +     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
   |         ╰─suggestion: Document 'destiation' parameter
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
35 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:33:83-33:83
31 |     /// - Parameter source: The starting node.
32 |     /// - Parameter destination: The destination node.
33 +     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
   |         ╰─suggestion: Document 'destiation' parameter
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
35 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:33:83-33:83
31 |     /// - Parameter source: The starting node.
32 |     /// - Parameter destination: The destination node.
33 +     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
   |         ╰─suggestion: Document 'destiation' parameter
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
35 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:33:83-33:83
31 |     /// - Parameter source: The starting node.
32 |     /// - Parameter destination: The destination node.
33 +     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
   |         ╰─suggestion: Document 'destiation' parameter
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
35 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:33:83-33:83
31 |     /// - Parameter source: The starting node.
32 |     /// - Parameter destination: The destination node.
33 +     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
   |         ╰─suggestion: Document 'destiation' parameter
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
35 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:33:83-33:83
31 |     /// - Parameter source: The starting node.
32 |     /// - Parameter destination: The destination node.
33 +     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
   |         ╰─suggestion: Document 'destiation' parameter
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
35 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:33:83-33:83
31 |     /// - Parameter source: The starting node.
32 |     /// - Parameter destination: The destination node.
33 +     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
   |         ╰─suggestion: Document 'destiation' parameter
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
35 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:33:83-33:83
31 |     /// - Parameter source: The starting node.
32 |     /// - Parameter destination: The destination node.
33 +     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
   |         ╰─suggestion: Document 'destiation' parameter
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
35 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:33:83-33:83
31 |     /// - Parameter source: The starting node.
32 |     /// - Parameter destination: The destination node.
33 +     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
   |         ╰─suggestion: Document 'destiation' parameter
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
35 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:33:83-33:83
31 |     /// - Parameter source: The starting node.
32 |     /// - Parameter destination: The destination node.
33 +     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
   |         ╰─suggestion: Document 'destiation' parameter
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
35 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:33:83-33:83
31 |     /// - Parameter source: The starting node.
32 |     /// - Parameter destination: The destination node.
33 +     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
   |         ╰─suggestion: Document 'destiation' parameter
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
35 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:33:83-33:83
31 |     /// - Parameter source: The starting node.
32 |     /// - Parameter destination: The destination node.
33 +     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
   |         ╰─suggestion: Document 'destiation' parameter
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
35 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:33:83-33:83
31 |     /// - Parameter source: The starting node.
32 |     /// - Parameter destination: The destination node.
33 +     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
   |         ╰─suggestion: Document 'destiation' parameter
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
35 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:33:83-33:83
31 |     /// - Parameter source: The starting node.
32 |     /// - Parameter destination: The destination node.
33 +     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
   |         ╰─suggestion: Document 'destiation' parameter
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
35 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:33:83-33:83
31 |     /// - Parameter source: The starting node.
32 |     /// - Parameter destination: The destination node.
33 +     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
   |         ╰─suggestion: Document 'destiation' parameter
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
35 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:33:83-33:83
31 |     /// - Parameter source: The starting node.
32 |     /// - Parameter destination: The destination node.
33 +     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
   |         ╰─suggestion: Document 'destiation' parameter
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
35 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:33:83-33:83
31 |     /// - Parameter source: The starting node.
32 |     /// - Parameter destination: The destination node.
33 +     /// - Parameter algorithm: The algorithm to use to compute the shortest paths.
   |         ╰─suggestion: Document 'destiation' parameter
34 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
35 |     @inlinable public func allShortestPaths(
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:21-45:32
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:21-45:32
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:21-45:32
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:21-45:32
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:21-45:32
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:21-45:32
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:21-45:32
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:21-45:32
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:21-45:32
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:21-45:32
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:21-45:32
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:21-45:32
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:21-45:32
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:21-45:32
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:21-45:32
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:21-45:32
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:21-45:32
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:21-45:32
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:21-45:32
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:21-45:32
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                     ╰─suggestion: Replace 'destination' with 'destiation'
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:55-45:55
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                                                       ╰─suggestion: Document 'destiation' parameter
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:55-45:55
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                                                       ╰─suggestion: Document 'destiation' parameter
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:55-45:55
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                                                       ╰─suggestion: Document 'destiation' parameter
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:55-45:55
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                                                       ╰─suggestion: Document 'destiation' parameter
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:55-45:55
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                                                       ╰─suggestion: Document 'destiation' parameter
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:55-45:55
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                                                       ╰─suggestion: Document 'destiation' parameter
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:55-45:55
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                                                       ╰─suggestion: Document 'destiation' parameter
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:55-45:55
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                                                       ╰─suggestion: Document 'destiation' parameter
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:55-45:55
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                                                       ╰─suggestion: Document 'destiation' parameter
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:55-45:55
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                                                       ╰─suggestion: Document 'destiation' parameter
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:55-45:55
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                                                       ╰─suggestion: Document 'destiation' parameter
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:55-45:55
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                                                       ╰─suggestion: Document 'destiation' parameter
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:55-45:55
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                                                       ╰─suggestion: Document 'destiation' parameter
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:55-45:55
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                                                       ╰─suggestion: Document 'destiation' parameter
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:55-45:55
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                                                       ╰─suggestion: Document 'destiation' parameter
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:55-45:55
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                                                       ╰─suggestion: Document 'destiation' parameter
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:55-45:55
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                                                       ╰─suggestion: Document 'destiation' parameter
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:55-45:55
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                                                       ╰─suggestion: Document 'destiation' parameter
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:55-45:55
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                                                       ╰─suggestion: Document 'destiation' parameter
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'destiation' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+AllShortestPaths.swift:45:55-45:55
43 |     /// Computes all shortest paths from the source node to the destination node in the graph using Dijkstra's algorithm.
44 |     /// - Parameter source: The starting node.
45 +     /// - Parameter destination: The destination node.
   |                                                       ╰─suggestion: Document 'destiation' parameter
46 |     /// - Returns: A dictionary where the keys are nodes and the values are arrays of paths.
47 |     @inlinable public func allShortestPaths(
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:20:11-20:48
18 |     ///   - source: The starting node.
19 |     ///   - destination: The target node.
20 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
21 |     ///   - algorithm: The algorithm to use for finding the shortest path.
22 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:20:11-20:48
18 |     ///   - source: The starting node.
19 |     ///   - destination: The target node.
20 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
21 |     ///   - algorithm: The algorithm to use for finding the shortest path.
22 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:20:11-20:48
18 |     ///   - source: The starting node.
19 |     ///   - destination: The target node.
20 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
21 |     ///   - algorithm: The algorithm to use for finding the shortest path.
22 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:20:11-20:48
18 |     ///   - source: The starting node.
19 |     ///   - destination: The target node.
20 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
21 |     ///   - algorithm: The algorithm to use for finding the shortest path.
22 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:20:11-20:48
18 |     ///   - source: The starting node.
19 |     ///   - destination: The target node.
20 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
21 |     ///   - algorithm: The algorithm to use for finding the shortest path.
22 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:20:11-20:48
18 |     ///   - source: The starting node.
19 |     ///   - destination: The target node.
20 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
21 |     ///   - algorithm: The algorithm to use for finding the shortest path.
22 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:20:11-20:48
18 |     ///   - source: The starting node.
19 |     ///   - destination: The target node.
20 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
21 |     ///   - algorithm: The algorithm to use for finding the shortest path.
22 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:20:11-20:48
18 |     ///   - source: The starting node.
19 |     ///   - destination: The target node.
20 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
21 |     ///   - algorithm: The algorithm to use for finding the shortest path.
22 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:20:11-20:48
18 |     ///   - source: The starting node.
19 |     ///   - destination: The target node.
20 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
21 |     ///   - algorithm: The algorithm to use for finding the shortest path.
22 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:20:11-20:48
18 |     ///   - source: The starting node.
19 |     ///   - destination: The target node.
20 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
21 |     ///   - algorithm: The algorithm to use for finding the shortest path.
22 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:20:11-20:48
18 |     ///   - source: The starting node.
19 |     ///   - destination: The target node.
20 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
21 |     ///   - algorithm: The algorithm to use for finding the shortest path.
22 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:20:11-20:48
18 |     ///   - source: The starting node.
19 |     ///   - destination: The target node.
20 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
21 |     ///   - algorithm: The algorithm to use for finding the shortest path.
22 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:20:11-20:48
18 |     ///   - source: The starting node.
19 |     ///   - destination: The target node.
20 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
21 |     ///   - algorithm: The algorithm to use for finding the shortest path.
22 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:20:11-20:48
18 |     ///   - source: The starting node.
19 |     ///   - destination: The target node.
20 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
21 |     ///   - algorithm: The algorithm to use for finding the shortest path.
22 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:20:11-20:48
18 |     ///   - source: The starting node.
19 |     ///   - destination: The target node.
20 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
21 |     ///   - algorithm: The algorithm to use for finding the shortest path.
22 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:20:11-20:48
18 |     ///   - source: The starting node.
19 |     ///   - destination: The target node.
20 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
21 |     ///   - algorithm: The algorithm to use for finding the shortest path.
22 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:20:11-20:48
18 |     ///   - source: The starting node.
19 |     ///   - destination: The target node.
20 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
21 |     ///   - algorithm: The algorithm to use for finding the shortest path.
22 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:20:11-20:48
18 |     ///   - source: The starting node.
19 |     ///   - destination: The target node.
20 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
21 |     ///   - algorithm: The algorithm to use for finding the shortest path.
22 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:20:11-20:48
18 |     ///   - source: The starting node.
19 |     ///   - destination: The target node.
20 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
21 |     ///   - algorithm: The algorithm to use for finding the shortest path.
22 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:20:11-20:48
18 |     ///   - source: The starting node.
19 |     ///   - destination: The target node.
20 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
21 |     ///   - algorithm: The algorithm to use for finding the shortest path.
22 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPath.swift:43:11-43:48
41 |     ///   - source: The starting node.
42 |     ///   - destination: The target node.
43 +     ///   - condition: The completion criteria.
   |           ╰─suggestion: Remove 'condition' parameter documentation
44 |     ///   - graph: The graph in which to find the shortest path.
45 |     /// - Returns: A `Path` instance representing the shortest path, or `nil` if no path is found.
warning: Parameter 'destination' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPathUntil+AStar.swift:37:77-37:77
35 | extension AStarUntilAlgorithm.Heuristic where HScore: FloatingPoint, HScore.Magnitude == HScore {
36 |     /// Creates a heuristic based on the Euclidean distance.
37 +     /// - Parameter value: A closure to extract the coordinates from a node.
   |                                                                             ╰─suggestion: Document 'destination' parameter
38 |     /// - Returns: An instance of `AStarUntilAlgorithm.Heuristic`.
39 |     @inlinable public static func euclideanDistance<Coordinate: SIMD>(
warning: Parameter 'destination' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPathUntil+AStar.swift:47:77-47:77
45 |
46 |     /// Creates a heuristic based on the Manhattan distance.
47 +     /// - Parameter value: A closure to extract the coordinates from a node.
   |                                                                             ╰─suggestion: Document 'destination' parameter
48 |     /// - Returns: An instance of `AStarUntilAlgorithm.Heuristic`.
49 |     @inlinable public static func manhattanDistance<Coordinate: SIMD>(
warning: Parameter 'destination' is missing documentation
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPathUntil+AStar.swift:71:108-71:108
69 |
70 |         /// Initializes a new heuristic with a distance algorithm.
71 +         /// - Parameter distanceAlgorithm: A distance algorithm to estimate the distance between two nodes.
   |                                                                                                            ╰─suggestion: Document 'destination' parameter
72 |         @inlinable public init(distanceAlgorithm: DistanceAlgorithm<Node, HScore>, towards destination: Node) where HScore.Magnitude == HScore {
73 |             self.init { distanceAlgorithm.distance($0, destination) }
warning: Parameter 'destination' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPathUntil+Dijkstra.swift:13:11-13:42
11 |     /// - Parameters:
12 |     ///   - source: The starting node.
13 +     ///   - destination: The target node.
   |           ╰─suggestion: Remove 'destination' parameter documentation
14 |     ///   - condition: The completion criteria.
15 |     ///   - graph: The graph in which to find the shortest path.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPathUntil.swift:41:9-41:82
39 |     /// - Parameter source: The starting node.
40 |     /// - Parameter destination: The target node.
41 +     /// - Parameter condition: A closure that determines when to stop the search.
   |         ╰─suggestion: Remove 'condition' parameter documentation
42 |     /// - Parameter graph: The graph in which to compute the shortest path.
43 |     /// - Returns: The shortest path from the source node to the destination node.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPathUntil.swift:41:9-41:82
39 |     /// - Parameter source: The starting node.
40 |     /// - Parameter destination: The target node.
41 +     /// - Parameter condition: A closure that determines when to stop the search.
   |         ╰─suggestion: Remove 'condition' parameter documentation
42 |     /// - Parameter graph: The graph in which to compute the shortest path.
43 |     /// - Returns: The shortest path from the source node to the destination node.
warning: Parameter 'condition' not found in instance method declaration
  --> ../Algorithms/ShortestPath/GraphComponent+ShortestPathUntil.swift:41:9-41:82
39 |     /// - Parameter source: The starting node.
40 |     /// - Parameter destination: The target node.
41 +     /// - Parameter condition: A closure that determines when to stop the search.
   |         ╰─suggestion: Remove 'condition' parameter documentation
42 |     /// - Parameter graph: The graph in which to compute the shortest path.
43 |     /// - Returns: The shortest path from the source node to the destination node.
warning: Return value documented for initializer returning void
  --> ../Concrete graphs/Transformations/PartitionedGraph.swift:18:9-18:48
16 |     ///  - leftPartition: The left partition of the bipartite graph.
17 |     ///  - rightPartition: The right partition of the bipartite graph.
18 +     /// - Returns: A `BipartiteGraph` instance.
   |         ╰─suggestion: Remove return value documentation
19 |     @inlinable public init(
20 |         base: Base,Finished building documentation for 'Graphs' (1.58s)
Generated documentation archive at:
  /Users/admin/builder/spi-builder-workspace/.docs/tevelee/swift-graphs/main
Fetching https://github.com/swiftlang/swift-docc-plugin
[1/2044] Fetching swift-docc-plugin
Updating https://github.com/apple/swift-numerics.git
Updating https://github.com/apple/swift-collections.git
Updating https://github.com/apple/swift-algorithms.git
Fetched https://github.com/swiftlang/swift-docc-plugin from cache (1.27s)
Updated https://github.com/apple/swift-numerics.git (0.47s)
Updated https://github.com/apple/swift-algorithms.git (0.47s)
Updated https://github.com/apple/swift-collections.git (0.61s)
Computing version for https://github.com/apple/swift-algorithms.git
Computed https://github.com/apple/swift-algorithms.git at 1.2.0 (0.56s)
Computing version for https://github.com/apple/swift-collections.git
Computed https://github.com/apple/swift-collections.git at 1.1.4 (0.68s)
Computing version for https://github.com/apple/swift-numerics.git
Computed https://github.com/apple/swift-numerics.git at 1.0.2 (0.57s)
Computing version for https://github.com/swiftlang/swift-docc-plugin
Computed https://github.com/swiftlang/swift-docc-plugin at 1.4.3 (0.55s)
Fetching https://github.com/swiftlang/swift-docc-symbolkit
[1/3210] Fetching swift-docc-symbolkit
Fetched https://github.com/swiftlang/swift-docc-symbolkit from cache (1.30s)
Computing version for https://github.com/swiftlang/swift-docc-symbolkit
Computed https://github.com/swiftlang/swift-docc-symbolkit at 1.0.0 (0.58s)
Creating working copy for https://github.com/swiftlang/swift-docc-symbolkit
Working copy of https://github.com/swiftlang/swift-docc-symbolkit resolved at 1.0.0
Creating working copy for https://github.com/swiftlang/swift-docc-plugin
Working copy of https://github.com/swiftlang/swift-docc-plugin resolved at 1.4.3
Building for debugging...
[0/8] Write sources
[2/8] Write snippet-extract-tool-entitlement.plist
[4/8] Write swift-version-5BDAB9E9C0126B9D.txt
[6/53] Emitting module SymbolKit
[7/57] Compiling SymbolKit Names.swift
[8/57] Compiling SymbolKit SPI.swift
[9/57] Compiling SymbolKit Snippet.swift
[10/57] Compiling SymbolKit Extension.swift
[11/57] Compiling SymbolKit Symbol.swift
[12/57] Compiling SymbolKit SymbolKind.swift
[13/57] Compiling SymbolKit SymbolGraph.swift
[14/57] Compiling SymbolKit GraphCollector.swift
[15/57] Compiling SymbolKit DeclarationFragments.swift
[16/57] Compiling SymbolKit Fragment.swift
[17/57] Compiling SymbolKit FragmentKind.swift
[18/57] Compiling SymbolKit FunctionParameter.swift
[19/57] Compiling SymbolKit FunctionSignature.swift
[20/57] Compiling SymbolKit SemanticVersion.swift
[21/57] Compiling SymbolKit AccessControl.swift
[22/57] Compiling SymbolKit Availability.swift
[23/57] Compiling SymbolKit AvailabilityItem.swift
[24/57] Compiling SymbolKit Domain.swift
[25/57] Compiling SymbolKit Identifier.swift
[26/57] Compiling SymbolKit KindIdentifier.swift
[27/57] Compiling SymbolKit Location.swift
[28/57] Compiling SymbolKit Mutability.swift
[29/57] Compiling SymbolKit Mixin+Equals.swift
[30/57] Compiling SymbolKit Mixin+Hash.swift
[31/57] Compiling SymbolKit Mixin.swift
[32/57] Compiling SymbolKit LineList.swift
[33/57] Compiling SymbolKit Position.swift
[34/57] Compiling SymbolKit Relationship.swift
[35/57] Compiling SymbolKit RelationshipKind.swift
[36/57] Compiling SymbolKit SourceOrigin.swift
[37/57] Compiling SymbolKit GenericConstraints.swift
[38/57] Compiling SymbolKit Swift.swift
[39/57] Compiling SymbolKit GenericConstraint.swift
[40/57] Compiling SymbolKit GenericParameter.swift
[41/57] Compiling SymbolKit Generics.swift
[42/57] Compiling SymbolKit Namespace.swift
[43/57] Compiling SymbolKit SourceRange.swift
[44/57] Compiling SymbolKit Metadata.swift
[45/57] Compiling SymbolKit Module.swift
[46/57] Compiling SymbolKit OperatingSystem.swift
[47/57] Compiling SymbolKit Platform.swift
[48/57] Emitting module Snippets
[49/57] Compiling Snippets SnippetParser.swift
[50/57] Compiling Snippets Snippet.swift
[51/57] Compiling SymbolKit UnifiedSymbol+Encodable.swift
[52/57] Compiling SymbolKit UnifiedSymbol.swift
[53/57] Compiling SymbolKit UnifiedSymbolGraph+Encodable.swift
[54/57] Compiling SymbolKit UnifiedSymbolGraph.swift
[55/61] Compiling snippet_extract URL+Status.swift
[56/61] Compiling snippet_extract SymbolGraph+Snippet.swift
[57/61] Emitting module snippet_extract
[58/61] Compiling snippet_extract SnippetBuildCommand.swift
[58/61] Write Objects.LinkFileList
[59/61] Linking snippet-extract-tool
[60/61] Applying snippet-extract-tool
Build of product 'snippet-extract' complete! (6.40s)
warning: 'swift-algorithms': found 1 file(s) which are unhandled; explicitly declare them as resources or exclude from the target
    /Users/admin/builder/spi-builder-workspace/.build/checkouts/swift-algorithms/Sources/Algorithms/Documentation.docc
Building for debugging...
[0/1] Write swift-version-5BDAB9E9C0126B9D.txt
[2/29] Compiling RealModule Float80+Real.swift
[3/30] Compiling InternalCollectionsUtilities UnsafeBufferPointer+Extras.swift
[4/31] Compiling RealModule RealFunctions.swift
[5/31] Compiling RealModule ElementaryFunctions.swift
[6/31] Compiling RealModule Double+Real.swift
[7/31] Compiling RealModule Real.swift
[8/31] Compiling RealModule Float+Real.swift
[9/31] Compiling RealModule ApproximateEquality.swift
[10/31] Compiling RealModule Float16+Real.swift
[11/31] Compiling RealModule AugmentedArithmetic.swift
[12/31] Compiling InternalCollectionsUtilities Debugging.swift
[13/31] Compiling InternalCollectionsUtilities Descriptions.swift
[14/31] Compiling InternalCollectionsUtilities RandomAccessCollection+Offsets.swift
[15/31] Compiling InternalCollectionsUtilities Specialize.swift
[16/31] Compiling InternalCollectionsUtilities UnsafeMutableBufferPointer+Extras.swift
[17/31] Compiling RealModule AlgebraicField.swift
[18/31] Emitting module RealModule
[19/31] Compiling InternalCollectionsUtilities _SortedCollection.swift
[20/31] Compiling InternalCollectionsUtilities _UniqueCollection.swift
[21/31] Compiling InternalCollectionsUtilities UInt+reversed.swift
[22/31] Compiling InternalCollectionsUtilities _UnsafeBitSet+Index.swift
[23/31] Compiling InternalCollectionsUtilities Integer rank.swift
[24/31] Compiling InternalCollectionsUtilities UInt+first and last set bit.swift
[25/31] Emitting module InternalCollectionsUtilities
[26/31] Compiling InternalCollectionsUtilities _UnsafeBitSet+_Word.swift
[27/31] Compiling InternalCollectionsUtilities _UnsafeBitSet.swift
[28/31] Compiling InternalCollectionsUtilities UnsafeMutableBufferPointer+SE-0370.swift
[29/31] Compiling InternalCollectionsUtilities UnsafeMutablePointer+SE-0370.swift
[30/31] Compiling InternalCollectionsUtilities UnsafeRawPointer extensions.swift
[31/31] Compiling InternalCollectionsUtilities FixedWidthInteger+roundUpToPowerOfTwo.swift
[32/136] Compiling DequeModule _DequeBufferHeader.swift
[33/136] Compiling DequeModule _DequeSlot.swift
[34/270] Compiling HeapModule _HeapNode.swift
[35/340] Compiling HeapModule Heap+UnsafeHandle.swift
[36/340] Compiling HeapModule Heap+Invariants.swift
[37/340] Compiling HeapModule Heap.swift
[38/340] Compiling HeapModule Heap+ExpressibleByArrayLiteral.swift
[39/340] Compiling HeapModule Heap+Descriptions.swift
[40/340] Emitting module HeapModule
[41/340] Compiling _RopeModule BigString+Split.swift
[42/340] Compiling _RopeModule Range+BigString.swift
[43/340] Compiling _RopeModule BigString+UTF16View.swift
[44/340] Compiling _RopeModule BigString+UTF8View.swift
[45/340] Compiling _RopeModule BigString+Chunk+RopeElement.swift
[46/340] Compiling _RopeModule BigString+Chunk+Splitting.swift
[47/340] Compiling _RopeModule Rope+_UnsafeHandle.swift
[48/340] Compiling _RopeModule Rope.swift
[49/340] Compiling _RopeModule RopeElement.swift
[50/348] Compiling _RopeModule BigString+Builder.swift
[51/348] Compiling _RopeModule BigString+Contents.swift
[52/348] Compiling _RopeModule BigString+Debugging.swift
[53/348] Compiling DequeModule _UnsafeWrappedBuffer.swift
[54/348] Compiling HashTreeCollections TreeSet+Equatable.swift
[55/348] Compiling HashTreeCollections TreeSet+ExpressibleByArrayLiteral.swift
[56/348] Compiling HashTreeCollections TreeSet+Extras.swift
[57/348] Compiling HashTreeCollections TreeSet+Filter.swift
[58/348] Compiling HashTreeCollections TreeSet+Hashable.swift
[59/348] Compiling HashTreeCollections TreeSet+Sendable.swift
[60/348] Compiling HashTreeCollections TreeSet+Sequence.swift
[61/348] Compiling HashTreeCollections TreeSet+SetAlgebra Initializers.swift
[62/356] Compiling _RopeModule BigString+Chunk+Breaks.swift
[63/356] Compiling _RopeModule BigString+Chunk+Counts.swift
[64/356] Compiling _RopeModule BigString+Chunk+Description.swift
[65/356] Compiling _RopeModule BigString+Chunk+Indexing by Characters.swift
[66/356] Compiling _RopeModule BigString+Chunk+Indexing by UTF16.swift
[67/356] Compiling _RopeModule BigString.swift
[68/356] Compiling _RopeModule BigString+Chunk+Append and Insert.swift
[69/356] Compiling _RopeModule _RopeVersion.swift
[70/356] Compiling _RopeModule Rope+Collection.swift
[71/356] Compiling _RopeModule Rope+_Node.swift
[72/356] Compiling _RopeModule Rope+_Storage.swift
[73/356] Compiling _RopeModule RopeMetric.swift
[74/356] Compiling _RopeModule RopeSummary.swift
[75/356] Compiling DequeModule _DequeBuffer.swift
[78/356] Compiling _RopeModule _RopeItem.swift
[79/356] Compiling _RopeModule _RopePath.swift
[82/361] Compiling _RopeModule BigString+UnicodeScalarView.swift
[83/361] Compiling _RopeModule BigSubstring+UTF16View.swift
[84/361] Compiling _RopeModule BigSubstring+UTF8View.swift
[85/361] Compiling _RopeModule BigSubstring+UnicodeScalarView.swift
[86/361] Compiling _RopeModule BigSubstring.swift
[87/361] Compiling _RopeModule Rope+Builder.swift
[88/361] Compiling _RopeModule Rope+Debugging.swift
[89/361] Compiling _RopeModule Rope+Invariants.swift
[90/361] Compiling _RopeModule Rope+_UnmanagedLeaf.swift
[96/361] Compiling _RopeModule Rope+Index.swift
[97/361] Compiling _RopeModule Rope+Sequence.swift
[98/361] Compiling _RopeModule BigString+Summary.swift
[123/361] Compiling HashTreeCollections TreeSet+SetAlgebra isStrictSuperset.swift
[124/361] Compiling HashTreeCollections TreeSet+SetAlgebra isSubset.swift
[125/361] Compiling HashTreeCollections TreeSet+SetAlgebra isSuperset.swift
[126/361] Compiling HashTreeCollections TreeSet+SetAlgebra subtract.swift
[127/361] Compiling HashTreeCollections TreeSet+SetAlgebra subtracting.swift
[128/361] Compiling HashTreeCollections TreeSet+SetAlgebra symmetricDifference.swift
[129/361] Compiling HashTreeCollections TreeSet+SetAlgebra union.swift
[130/361] Compiling HashTreeCollections TreeSet.swift
[131/361] Compiling Algorithms Unique.swift
[132/361] Compiling Algorithms Windows.swift
[133/361] Emitting module BitCollections
[140/361] Compiling _RopeModule BigString+ReplaceSubrange.swift
[146/361] Compiling BitCollections BitSet.swift
[147/361] Compiling BitCollections Range+Utilities.swift
[148/361] Compiling BitCollections Slice+Utilities.swift
[149/361] Compiling BitCollections UInt+Tricks.swift
[150/361] Compiling BitCollections _Word.swift
[151/361] Compiling _RopeModule BigString+TextOutputStream.swift
[152/361] Compiling _RopeModule BigString+Append.swift
[153/361] Compiling _RopeModule BigString+Initializers.swift
[154/361] Compiling _RopeModule BigString+Insert.swift
[155/361] Compiling _RopeModule BigString+Managing Breaks.swift
[156/361] Compiling _RopeModule BigString+RemoveSubrange.swift
[157/361] Compiling _RopeModule Rope+MutatingForEach.swift
[158/361] Compiling _RopeModule BigString+ExpressibleByStringLiteral.swift
[159/361] Compiling _RopeModule BigString+Hashing.swift
[160/361] Compiling _RopeModule BigString+LosslessStringConvertible.swift
[161/361] Compiling _RopeModule BigString+RangeReplaceableCollection.swift
[162/361] Compiling _RopeModule BigString+Sequence.swift
[163/361] Emitting module DequeModule
[176/361] Compiling _RopeModule Rope+Append.swift
[177/361] Compiling _RopeModule Rope+Extract.swift
[178/361] Compiling _RopeModule Rope+Find.swift
[179/361] Compiling _RopeModule Rope+ForEachWhile.swift
[180/361] Compiling _RopeModule Rope+Insert.swift
[181/361] Compiling _RopeModule Rope+Join.swift
[185/361] Compiling _RopeModule BigString+Invariants.swift
[186/361] Compiling _RopeModule BigString+Iterators.swift
[187/361] Compiling _RopeModule BigString+Metrics.swift
[194/361] Compiling OrderedCollections OrderedSet.swift
[195/361] Compiling OrderedCollections _UnsafeBitset.swift
[314/368] Emitting module OrderedCollections
[315/368] Compiling _RopeModule Rope+Remove.swift
[316/368] Compiling _RopeModule Rope+RemoveSubrange.swift
[317/368] Compiling _RopeModule Rope+Split.swift
[318/368] Compiling _RopeModule Optional Utilities.swift
[319/368] Compiling _RopeModule String Utilities.swift
[320/368] Compiling _RopeModule String.Index+ABI.swift
[321/368] Compiling _RopeModule _CharacterRecognizer.swift
[349/368] Emitting module Algorithms
[350/368] Emitting module _RopeModule
[360/368] Emitting module HashTreeCollections
[369/370] Compiling Collections Collections.swift
[370/370] Emitting module Collections
[371/461] Compiling Graphs Graph+TraversalStrategy+DFS+Preorder.swift
[372/461] Compiling Graphs Graph+TraversalStrategy+DFS.swift
[373/461] Compiling Graphs Graph+TraversalStrategy+IterativelyDeepeningDFS.swift
[374/461] Compiling Graphs Graph+TraversalStrategy+Limited.swift
[375/461] Compiling Graphs Graph+TraversalStrategy+Priority.swift
[376/461] Compiling Graphs Graph+TraversalStrategy+Unique.swift
[377/461] Compiling Graphs Graph+TraversalStrategy.swift
[378/461] Compiling Graphs Graph+Visitor+AncestorTracking.swift
[379/461] Compiling Graphs Graph+Visitor+DepthTracking.swift
[380/461] Compiling Graphs Graph+Visitor+NodesTracking.swift
[381/471] Compiling Graphs GraphComponent+ShortestPath+AStar.swift
[382/471] Compiling Graphs GraphComponent+ShortestPath+Dijkstra.swift
[383/471] Compiling Graphs GraphComponent+ShortestPath.swift
[384/471] Compiling Graphs GraphComponent+ShortestPathUntil+AStar.swift
[385/471] Compiling Graphs GraphComponent+ShortestPathUntil+Dijkstra.swift
[386/471] Compiling Graphs GraphComponent+ShortestPathUntil.swift
[387/471] Compiling Graphs GraphComponent+ShortestPaths+Dijkstra.swift
[388/471] Compiling Graphs GraphComponent+ShortestPaths.swift
[389/471] Compiling Graphs Graph+StronglyConnectedComponents+Kosaraju.swift
[390/471] Compiling Graphs Graph+StronglyConnectedComponents+Tarjan.swift
[391/471] Compiling Graphs Graph+Visitor+PathTracking.swift
[392/471] Compiling Graphs Graph+Visitor.swift
[393/471] Compiling Graphs BinaryGraph.swift
[394/471] Compiling Graphs BipartiteGraph.swift
[395/471] Compiling Graphs ConnectedBinaryGraph.swift
[396/471] Compiling Graphs ConnectedBinaryHashGraph.swift
[397/471] Compiling Graphs ConnectedGraph.swift
[398/471] Compiling Graphs ConnectedHashGraph.swift
[399/471] Compiling Graphs DisjointBinaryGraph.swift
[400/471] Compiling Graphs DisjointBinaryHashGraph.swift
[401/471] Compiling Graphs Graph+KShortestPaths.swift
[402/471] Compiling Graphs Graph+ShortestPathOnWholeGraph+BellmanFord.swift
[403/471] Compiling Graphs Graph+ShortestPathOnWholeGraph+BidirectionalDijkstra.swift
[404/471] Compiling Graphs Graph+ShortestPathOnWholeGraph.swift
[405/471] Compiling Graphs Graph+ShortestPathsForAllPairs+FloydWarshall.swift
[406/471] Compiling Graphs Graph+ShortestPathsForAllPairs+Johnson.swift
[407/471] Compiling Graphs Graph+ShortestPathsForAllPairs.swift
[408/471] Compiling Graphs Graph+ShortestPathsOnWholeGraph+BellmanFord.swift
[409/471] Compiling Graphs Graph+ShortestPathsOnWholeGraph.swift
[410/471] Compiling Graphs GraphComponent+AllShortestPaths.swift
[411/471] Compiling Graphs Graph+MinimumSpanningTree+Kruskal.swift
[412/471] Compiling Graphs Graph+MinimumSpanningTree+Prim.swift
[413/471] Compiling Graphs Graph+MinimumSpanningTree.swift
[414/471] Compiling Graphs ConnectedGraph+Random.swift
[415/471] Compiling Graphs DisjointGraph+Random.swift
[416/471] Compiling Graphs Graph+Random+BarabasiAlbert.swift
[417/471] Compiling Graphs Graph+Random+ErdosRenyi.swift
[418/471] Compiling Graphs Graph+Random+WattsStrogatz.swift
[419/471] Compiling Graphs Graph+Random.swift
[420/471] Compiling Graphs Graph+KShortestPaths+Yen.swift
[421/471] Compiling Graphs Graph+StronglyConnectedComponents.swift
[422/471] Compiling Graphs BinaryGraph+Search.swift
[423/471] Compiling Graphs BinaryGraph+Traversal.swift
[424/471] Compiling Graphs BinaryGraph+TraversalStrategy+DFS+Inorder.swift
[425/471] Compiling Graphs BinaryGraph+TraversalStrategy.swift
[426/471] Compiling Graphs Graph+Search.swift
[427/471] Compiling Graphs Graph+Traversal.swift
[428/471] Compiling Graphs Graph+TraversalStrategy+Acyclic.swift
[429/471] Compiling Graphs Graph+TraversalStrategy+BFS.swift
[430/471] Compiling Graphs Graph+TraversalStrategy+DFS+Postorder.swift
[431/471] Compiling Graphs Graph+Coloring+DSatur.swift
[432/471] Compiling Graphs Graph+Coloring+Greedy.swift
[433/471] Compiling Graphs Graph+Coloring+WelshPowell.swift
[434/471] Compiling Graphs Graph+Coloring.swift
[435/471] Compiling Graphs Graph+EulerianPath+Backtracking.swift
[436/471] Compiling Graphs Graph+EulerianPath+Hierholzer.swift
[437/471] Compiling Graphs Graph+EulerianPath.swift
[438/471] Compiling Graphs Graph+HamiltonianPath+Backtracking.swift
[439/471] Compiling Graphs Graph+HamiltonianPath+Heuristic.swift
[440/471] Compiling Graphs Graph+HamiltonianPath.swift
[441/471] Compiling Graphs Graph+Isomophism+VF2.swift
[442/471] Compiling Graphs Graph+Isomophism+WeisfeilerLehman.swift
[443/471] Compiling Graphs Graph+Isomophism.swift
[444/471] Compiling Graphs MaximumMatchingAlgorithm+HopcroftKarp.swift
[445/471] Compiling Graphs MaximumMatchingAlgorithm.swift
[446/471] Compiling Graphs Graph+MaxFlow+Dinic.swift
[447/471] Compiling Graphs Graph+MaxFlow+EdmondsKarp.swift
[448/471] Compiling Graphs Graph+MaxFlow+FordFulkerson.swift
[449/471] Compiling Graphs Graph+MaxFlow.swift
[450/471] Compiling Graphs Graph+MinimumSpanningTree+Boruvka.swift
[451/471] Compiling Graphs DisjointGraph.swift
[452/471] Compiling Graphs DisjointHashGraph.swift
[453/471] Compiling Graphs GridGraph.swift
[454/471] Compiling Graphs LazyBinaryGraph.swift
[455/471] Compiling Graphs LazyGraph.swift
[456/471] Compiling Graphs ComplementGraph.swift
[457/471] Compiling Graphs Graph+Equatable.swift
[458/471] Compiling Graphs Graph+Hashable.swift
[459/471] Compiling Graphs PartitionedGraph.swift
[460/471] Compiling Graphs ResidualGraph.swift
[461/471] Compiling Graphs TransposedGraph.swift
[462/471] Compiling Graphs UndirectedGraph.swift
[463/471] Compiling Graphs WeightedGraph.swift
[464/471] Compiling Graphs Distance.swift
[465/471] Compiling Graphs Graph+Properties.swift
[466/471] Compiling Graphs Graph.swift
[467/471] Compiling Graphs GraphComponent.swift
[468/471] Compiling Graphs MutableGraph.swift
[469/471] Compiling Graphs Utils.swift
[470/471] Compiling Graphs Weighted.swift
[471/471] Emitting module Graphs
Build of target: 'Graphs' complete! (4.59s)
    5206
40	/Users/admin/builder/spi-builder-workspace/.docs/tevelee/swift-graphs/main
✅  Doc result (uploading) reported
========================================
SyncDocs
========================================
Doc archive source directory: $PWD/.docs/tevelee/swift-graphs/main
File count: 5206
Doc size:   40.0MB
Preparing doc bundle ...
Uploading prod-tevelee-swift-graphs-main-61bd1c54.zip to s3://spi-docs-inbox/prod-tevelee-swift-graphs-main-61bd1c54.zip
Copying... [10%]
Copying... [20%]
Copying... [30%]
Copying... [40%]
Copying... [50%]
Copying... [60%]
Copying... [70%]
Copying... [80%]
Copying... [90%]
Copying... [100%]
Done.