Move from legacy clue/graph to successor graphp/graph

Refs graphp/graph#166
clue-labs · Feb 19, 2020 · 0833f8f · 0833f8f
1 parent 507fb67
commit 0833f8f
Show file tree

Hide file tree

Showing 80 changed files with 189 additions and 191 deletions.
diff --git a/composer.json b/composer.json
@@ -12,7 +12,7 @@
     ],
     "require": {
         "php": ">=5.3",
-        "clue/graph": "~0.9.0|~0.8.0"
+        "graphp/graph": "dev-master#9b4ff23 as 1.0.0"
     },
     "require-dev": {
         "phpunit/phpunit": "^6.4 || ^5.7 || ^4.8.35"

diff --git a/src/BaseDual.php b/src/BaseDual.php
@@ -2,9 +2,9 @@
 
 namespace Graphp\Algorithms;
 
-use Fhaculty\Graph\Graph;
-use Fhaculty\Graph\Set\DualAggregate;
-use Fhaculty\Graph\Walk;
+use Graphp\Graph\Graph;
+use Graphp\Graph\Set\DualAggregate;
+use Graphp\Graph\Walk;
 
 /**
  * Abstract base class for algorithms that operate on a given Set instance

diff --git a/src/BaseGraph.php b/src/BaseGraph.php
@@ -2,7 +2,7 @@
 
 namespace Graphp\Algorithms;
 
-use Fhaculty\Graph\Graph;
+use Graphp\Graph\Graph;
 
 /**
  * Abstract base class for algorithms that operate on a given Graph instance

diff --git a/src/BaseVertex.php b/src/BaseVertex.php
@@ -2,7 +2,7 @@
 
 namespace Graphp\Algorithms;
 
-use Fhaculty\Graph\Vertex;
+use Graphp\Graph\Vertex;
 
 /**
  * Abstract base class for algorithms that operate on a given Vertex instance

diff --git a/src/Bipartit.php b/src/Bipartit.php
@@ -2,8 +2,8 @@
 
 namespace Graphp\Algorithms;
 
-use Fhaculty\Graph\Exception\UnexpectedValueException;
-use Fhaculty\Graph\Graph;
+use Graphp\Graph\Exception\UnexpectedValueException;
+use Graphp\Graph\Graph;
 
 class Bipartit extends BaseGraph
 {

diff --git a/src/ConnectedComponents.php b/src/ConnectedComponents.php
@@ -2,11 +2,11 @@
 
 namespace Graphp\Algorithms;
 
-use Fhaculty\Graph\Exception\InvalidArgumentException;
-use Fhaculty\Graph\Exception\UnderflowException;
-use Fhaculty\Graph\Graph;
-use Fhaculty\Graph\Vertex;
 use Graphp\Algorithms\Search\BreadthFirst as SearchBreadthFirst;
+use Graphp\Graph\Exception\InvalidArgumentException;
+use Graphp\Graph\Exception\UnderflowException;
+use Graphp\Graph\Graph;
+use Graphp\Graph\Vertex;
 
 /**
  * Algorithm for working with connected components

diff --git a/src/Degree.php b/src/Degree.php
@@ -2,9 +2,9 @@
 
 namespace Graphp\Algorithms;
 
-use Fhaculty\Graph\Exception\UnderflowException;
-use Fhaculty\Graph\Exception\UnexpectedValueException;
-use Fhaculty\Graph\Vertex;
+use Graphp\Graph\Exception\UnderflowException;
+use Graphp\Graph\Exception\UnexpectedValueException;
+use Graphp\Graph\Vertex;
 
 /**
  * Basic algorithms for working with the degrees of Graphs.

diff --git a/src/DetectNegativeCycle.php b/src/DetectNegativeCycle.php
@@ -2,11 +2,11 @@
 
 namespace Graphp\Algorithms;
 
-use Fhaculty\Graph\Exception\NegativeCycleException;
-use Fhaculty\Graph\Exception\UnderflowException;
-use Fhaculty\Graph\Graph;
-use Fhaculty\Graph\Walk;
 use Graphp\Algorithms\ShortestPath\MooreBellmanFord as SpMooreBellmanFord;
+use Graphp\Graph\Exception\NegativeCycleException;
+use Graphp\Graph\Exception\UnderflowException;
+use Graphp\Graph\Graph;
+use Graphp\Graph\Walk;
 
 class DetectNegativeCycle extends BaseGraph
 {

diff --git a/src/Directed.php b/src/Directed.php
@@ -2,8 +2,8 @@
 
 namespace Graphp\Algorithms;
 
-use Fhaculty\Graph\Edge\Directed as EdgeDirected;
-use Fhaculty\Graph\Edge\Undirected as EdgeUndirected;
+use Graphp\Graph\Edge\Directed as EdgeDirected;
+use Graphp\Graph\Edge\Undirected as EdgeUndirected;
 
 /**
  * Basic algorithms for working with the undirected or directed Graphs (digraphs) / Walks.

diff --git a/src/Flow.php b/src/Flow.php
@@ -2,9 +2,9 @@
 
 namespace Graphp\Algorithms;
 
-use Fhaculty\Graph\Edge\Directed as EdgeDirected;
-use Fhaculty\Graph\Exception\UnexpectedValueException;
-use Fhaculty\Graph\Vertex;
+use Graphp\Graph\Edge\Directed as EdgeDirected;
+use Graphp\Graph\Exception\UnexpectedValueException;
+use Graphp\Graph\Vertex;
 
 /**
  * Basic algorithms for working with flow graphs

diff --git a/src/Groups.php b/src/Groups.php
@@ -2,8 +2,8 @@
 
 namespace Graphp\Algorithms;
 
-use Fhaculty\Graph\Set\Vertices;
-use Fhaculty\Graph\Vertex;
+use Graphp\Graph\Set\Vertices;
+use Graphp\Graph\Vertex;
 
 class Groups extends BaseGraph
 {

diff --git a/src/Loop.php b/src/Loop.php
@@ -2,7 +2,7 @@
 
 namespace Graphp\Algorithms;
 
-use Fhaculty\Graph\Vertex;
+use Graphp\Graph\Vertex;
 
 /**
  * Basic algorithms for working with loop edges

diff --git a/src/MaxFlow/EdmondsKarp.php b/src/MaxFlow/EdmondsKarp.php
@@ -2,17 +2,17 @@
 
 namespace Graphp\Algorithms\MaxFlow;
 
-use Fhaculty\Graph\Edge\Directed as EdgeDirected;
-use Fhaculty\Graph\Exception\InvalidArgumentException;
-use Fhaculty\Graph\Exception\OutOfBoundsException;
-use Fhaculty\Graph\Exception\UnderflowException;
-use Fhaculty\Graph\Exception\UnexpectedValueException;
-use Fhaculty\Graph\Graph;
-use Fhaculty\Graph\Set\Edges;
-use Fhaculty\Graph\Vertex;
 use Graphp\Algorithms\Base;
 use Graphp\Algorithms\ResidualGraph;
 use Graphp\Algorithms\ShortestPath\BreadthFirst;
+use Graphp\Graph\Edge\Directed as EdgeDirected;
+use Graphp\Graph\Exception\InvalidArgumentException;
+use Graphp\Graph\Exception\OutOfBoundsException;
+use Graphp\Graph\Exception\UnderflowException;
+use Graphp\Graph\Exception\UnexpectedValueException;
+use Graphp\Graph\Graph;
+use Graphp\Graph\Set\Edges;
+use Graphp\Graph\Vertex;
 
 class EdmondsKarp extends Base
 {

diff --git a/src/MaximumMatching/Base.php b/src/MaximumMatching/Base.php
@@ -2,10 +2,10 @@
 
 namespace Graphp\Algorithms\MaximumMatching;
 
-use Fhaculty\Graph\Exception\UnexpectedValueException;
-use Fhaculty\Graph\Graph;
-use Fhaculty\Graph\Set\Edges;
 use Graphp\Algorithms\BaseGraph;
+use Graphp\Graph\Exception\UnexpectedValueException;
+use Graphp\Graph\Graph;
+use Graphp\Graph\Set\Edges;
 
 abstract class Base extends BaseGraph
 {

diff --git a/src/MaximumMatching/Flow.php b/src/MaximumMatching/Flow.php
@@ -2,12 +2,12 @@
 
 namespace Graphp\Algorithms\MaximumMatching;
 
-use Fhaculty\Graph\Exception\UnexpectedValueException;
-use Fhaculty\Graph\Set\Edges;
-use Fhaculty\Graph\Vertex;
 use Graphp\Algorithms\Directed;
 use Graphp\Algorithms\Groups;
 use Graphp\Algorithms\MaxFlow\EdmondsKarp as MaxFlowEdmondsKarp;
+use Graphp\Graph\Exception\UnexpectedValueException;
+use Graphp\Graph\Set\Edges;
+use Graphp\Graph\Vertex;
 
 class Flow extends Base
 {

diff --git a/src/MinimumCostFlow/Base.php b/src/MinimumCostFlow/Base.php
@@ -5,10 +5,10 @@
 use Graphp\Algorithms\BaseGraph;
 use Graphp\Algorithms\Weight as AlgorithmWeight;
 use Graphp\Algorithms\Flow as AlgorithmFlow;
-use Fhaculty\Graph\Exception\UnderflowException;
-use Fhaculty\Graph\Exception\UnexpectedValueException;
-use Fhaculty\Graph\Graph;
-use Fhaculty\Graph\Set\Edges;
+use Graphp\Graph\Exception\UnderflowException;
+use Graphp\Graph\Exception\UnexpectedValueException;
+use Graphp\Graph\Graph;
+use Graphp\Graph\Set\Edges;
 
 abstract class Base extends BaseGraph
 {

diff --git a/src/MinimumCostFlow/CycleCanceling.php b/src/MinimumCostFlow/CycleCanceling.php
@@ -2,12 +2,12 @@
 
 namespace Graphp\Algorithms\MinimumCostFlow;
 
-use Fhaculty\Graph\Exception\UnderflowException;
-use Fhaculty\Graph\Exception\UnexpectedValueException;
-use Fhaculty\Graph\Set\Edges;
 use Graphp\Algorithms\DetectNegativeCycle;
 use Graphp\Algorithms\MaxFlow\EdmondsKarp as MaxFlowEdmondsKarp;
 use Graphp\Algorithms\ResidualGraph;
+use Graphp\Graph\Exception\UnderflowException;
+use Graphp\Graph\Exception\UnexpectedValueException;
+use Graphp\Graph\Set\Edges;
 
 class CycleCanceling extends Base
 {

diff --git a/src/MinimumCostFlow/SuccessiveShortestPath.php b/src/MinimumCostFlow/SuccessiveShortestPath.php
@@ -2,15 +2,15 @@
 
 namespace Graphp\Algorithms\MinimumCostFlow;
 
-use Fhaculty\Graph\Edge\Directed as EdgeDirected;
-use Fhaculty\Graph\Exception\UnderflowException;
-use Fhaculty\Graph\Exception\UnexpectedValueException;
-use Fhaculty\Graph\Graph;
-use Fhaculty\Graph\Set\Edges;
-use Fhaculty\Graph\Vertex;
 use Graphp\Algorithms\ResidualGraph;
 use Graphp\Algorithms\ShortestPath\MooreBellmanFord as SpMooreBellmanFord;
 use Graphp\Algorithms\Search\BreadthFirst as SearchBreadthFirst;
+use Graphp\Graph\Edge\Directed as EdgeDirected;
+use Graphp\Graph\Exception\UnderflowException;
+use Graphp\Graph\Exception\UnexpectedValueException;
+use Graphp\Graph\Graph;
+use Graphp\Graph\Set\Edges;
+use Graphp\Graph\Vertex;
 
 class SuccessiveShortestPath extends Base
 {

diff --git a/src/MinimumSpanningTree/Base.php b/src/MinimumSpanningTree/Base.php
@@ -2,10 +2,10 @@
 
 namespace Graphp\Algorithms\MinimumSpanningTree;
 
-use Fhaculty\Graph\Edge\Base as Edge;
-use Fhaculty\Graph\Graph;
-use Fhaculty\Graph\Set\Edges;
 use Graphp\Algorithms\Base as AlgorithmBase;
+use Graphp\Graph\Edge\Base as Edge;
+use Graphp\Graph\Graph;
+use Graphp\Graph\Set\Edges;
 use SplPriorityQueue;
 
 /**

diff --git a/src/MinimumSpanningTree/Kruskal.php b/src/MinimumSpanningTree/Kruskal.php
@@ -2,10 +2,10 @@
 
 namespace Graphp\Algorithms\MinimumSpanningTree;
 
-use Fhaculty\Graph\Edge\Base as Edge;
-use Fhaculty\Graph\Exception\UnexpectedValueException;
-use Fhaculty\Graph\Graph;
-use Fhaculty\Graph\Set\Edges;
+use Graphp\Graph\Edge\Base as Edge;
+use Graphp\Graph\Exception\UnexpectedValueException;
+use Graphp\Graph\Graph;
+use Graphp\Graph\Set\Edges;
 use SplPriorityQueue;
 
 class Kruskal extends Base

diff --git a/src/MinimumSpanningTree/Prim.php b/src/MinimumSpanningTree/Prim.php
@@ -2,10 +2,10 @@
 
 namespace Graphp\Algorithms\MinimumSpanningTree;
 
-use Fhaculty\Graph\Edge\Base as Edge;
-use Fhaculty\Graph\Exception\UnexpectedValueException;
-use Fhaculty\Graph\Set\Edges;
-use Fhaculty\Graph\Vertex;
+use Graphp\Graph\Edge\Base as Edge;
+use Graphp\Graph\Exception\UnexpectedValueException;
+use Graphp\Graph\Set\Edges;
+use Graphp\Graph\Vertex;
 use SplPriorityQueue;
 
 class Prim extends Base

diff --git a/src/Parallel.php b/src/Parallel.php
@@ -2,10 +2,9 @@
 
 namespace Graphp\Algorithms;
 
-use Fhaculty\Graph\Edge\Base as Edge;
-use Fhaculty\Graph\Edge\Directed as DirectedEdge;
-use Fhaculty\Graph\Set\Edges;
-use LogicException;
+use Graphp\Graph\Edge\Base as Edge;
+use Graphp\Graph\Edge\Directed as DirectedEdge;
+use Graphp\Graph\Set\Edges;
 
 /**
  * Basic algorithms for working with parallel edges
@@ -52,7 +51,6 @@ public function hasEdgeParallelEdge(Edge $edge)
      *
      * @param Edge $edge
      * @return Edges
-     * @throws LogicException
      */
     public function getEdgesParallelEdge(Edge $edge)
     {

diff --git a/src/Property/WalkProperty.php b/src/Property/WalkProperty.php
@@ -2,9 +2,9 @@
 
 namespace Graphp\Algorithms\Property;
 
-use Fhaculty\Graph\Walk;
 use Graphp\Algorithms\Base as BaseAlgorithm;
 use Graphp\Algorithms\Loop as AlgorithmLoop;
+use Graphp\Graph\Walk;
 
 /**
  * Simple algorithms for working with Walk properties

diff --git a/src/ResidualGraph.php b/src/ResidualGraph.php
@@ -2,10 +2,10 @@
 
 namespace Graphp\Algorithms;
 
-use Fhaculty\Graph\Edge\Base as Edge;
-use Fhaculty\Graph\Edge\Directed as EdgeDirected;
-use Fhaculty\Graph\Exception\UnexpectedValueException;
-use Fhaculty\Graph\Graph;
+use Graphp\Graph\Edge\Base as Edge;
+use Graphp\Graph\Edge\Directed as EdgeDirected;
+use Graphp\Graph\Exception\UnexpectedValueException;
+use Graphp\Graph\Graph;
 
 class ResidualGraph extends BaseGraph
 {

diff --git a/src/Search/Base.php b/src/Search/Base.php
@@ -2,10 +2,10 @@
 
 namespace Graphp\Algorithms\Search;
 
-use Fhaculty\Graph\Exception\InvalidArgumentException;
-use Fhaculty\Graph\Set\Vertices;
-use Fhaculty\Graph\Vertex;
 use Graphp\Algorithms\BaseVertex;
+use Graphp\Graph\Exception\InvalidArgumentException;
+use Graphp\Graph\Set\Vertices;
+use Graphp\Graph\Vertex;
 
 abstract class Base extends BaseVertex
 {

diff --git a/src/Search/BreadthFirst.php b/src/Search/BreadthFirst.php
@@ -2,7 +2,7 @@
 
 namespace Graphp\Algorithms\Search;
 
-use Fhaculty\Graph\Set\Vertices;
+use Graphp\Graph\Set\Vertices;
 
 class BreadthFirst extends Base
 {

diff --git a/src/Search/DepthFirst.php b/src/Search/DepthFirst.php
@@ -2,7 +2,7 @@
 
 namespace Graphp\Algorithms\Search;
 
-use Fhaculty\Graph\Set\Vertices;
+use Graphp\Graph\Set\Vertices;
 
 class DepthFirst extends Base
 {

diff --git a/src/ShortestPath/Base.php b/src/ShortestPath/Base.php
@@ -2,15 +2,15 @@
 
 namespace Graphp\Algorithms\ShortestPath;
 
-use Fhaculty\Graph\Edge\Base as Edge;
-use Fhaculty\Graph\Exception\InvalidArgumentException;
-use Fhaculty\Graph\Exception\OutOfBoundsException;
-use Fhaculty\Graph\Graph;
-use Fhaculty\Graph\Set\Edges;
-use Fhaculty\Graph\Set\Vertices;
-use Fhaculty\Graph\Vertex;
-use Fhaculty\Graph\Walk;
 use Graphp\Algorithms\BaseVertex;
+use Graphp\Graph\Edge\Base as Edge;
+use Graphp\Graph\Exception\InvalidArgumentException;
+use Graphp\Graph\Exception\OutOfBoundsException;
+use Graphp\Graph\Graph;
+use Graphp\Graph\Set\Edges;
+use Graphp\Graph\Set\Vertices;
+use Graphp\Graph\Vertex;
+use Graphp\Graph\Walk;
 
 /**
  * Abstract base class for shortest path algorithms