Download the PHP package php-science/pagerank without Composer
On this page you can find all versions of the php package php-science/pagerank. It is possible to download/install these versions without Composer. Possible dependencies are resolved automatically.
Download php-science/pagerank
More information about php-science/pagerank
Files in php-science/pagerank
Package pagerank
Short Description OOP Pagerank implementation with strict type.
License MIT
FAQ
Example:
In general, it is recommended to use always a project to download your libraries. In an application normally there is more than one library needed.
- Some hosting areas are not accessible by a terminal or SSH. Then it is not possible to use Composer.
- To use Composer is sometimes complicated. Especially for beginners.
- Composer needs much resources. Sometimes they are not available on a simple webspace.
- If you are using private repositories you don't need to share your credentials. You can set up everything on our site and then you provide a simple download link to your team member.
- Simplify your Composer build process. Use our own command line tool to download the vendor folder as binary. This makes your build process faster and you don't need to expose your credentials for private repositories.
Informations about the package pagerank
PageRank
This source code is an OOP implementation of the PageRank algorithm.
About
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.
Workflow
- It calculates the initial ranking values. At the first iteration, all the nodes have the same rank.
- Iterates the nodes using the power method/iteration technique over and over again until it reaches the maximum iteration number.
- However, the iteration stops when the ranks are accurate enough even if the max iteration didn't reach its limit.
- The accuracy measured by the float epsilon constant.
- At the end, the algorithm normalizes the ranks between 0 and 1 and then scale them between 1 and 10. The scaling range is configurable.
- Getting, setting, updating the nodes from the resource is a responsibility of the NodeDataSourceStrategyInterface.
- The package provides a simple implementation of the NodeDataSourceStrategyInterface that only keeps the nodes in the memory. Another way of implementing the NodeDataSourceStrategyInterface could be a simple class that uses an ORM to handle the node collection.
Install
Example
Functional Sample
- test: Functional test case
- running the test:
