This source code is an OOP implementation of the PageRank algorithm.
This implementation is based on Larry Page's PageRank algorithm. It weights the connections between the nodes in a graph. In theory, the nodes can be websites, words, people, etc. As the number of the nodes are increasing the algorithm is becoming slower. To scale the size and handle millions of nodes, the accuracy of the calculation can be limited, and the long-running calculation can be scheduled in batches using the Strategy OOP pattern in the implementation.
composer require php-science/pagerank
$dataSource = $this->getYourDataSource(); $nodeBuilder = new NodeBuilder(); $nodeCollectionBuilder = new NodeCollectionBuilder(); $strategy = new MemorySourceStrategy( $nodeBuilder, $nodeCollectionBuilder, $dataSource ); $rankComparator = new RankComparator(); $ranking = new Ranking( $rankComparator, $strategy ); $normalizer = new Normalizer(); $pageRankAlgorithm = new PageRankAlgorithm( $ranking, $strategy, $normalizer ); $maxIteration = 100; $nodeCollection = $pageRankAlgorithm->run($maxIteration); var_dump($nodeCollection->getNodes());