Download the PHP
package relaxedws/lca without Composer
On this page you can find all versions of the php package
relaxedws/lca. It is possible to download/install
these versions without Composer. Possible dependencies are resolved
automatically.
Vendor relaxedws Package lca Short Description Library used to find lowest common ancestor in graphs. License
GPL-3.0+
FAQ
After the download, you have to make one include require_once('vendor/autoload.php');. After that you have to import the classes with use statements.
Example:
If you use only one package a project is not needed. But if you use more then one package, without a project it is not possible to import the classes with use statements.
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 PHP packages are not free to download and because of that hosted in private repositories.
In this case some credentials are needed to access such packages.
Please use the auth.json textarea to insert credentials, if a package is coming from a private repository.
You can look here for more information.
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.
A PHP Library to find Lowest Common ancestor from a Directed Acyclic Graph.
Insight
This library is built to find the Lowest Common ancestor from a Directed Acyclic graph. It first creates a graph and then stores the parents of
a node(let's call it node1) in an array(call it array1). To find the parents of node1, we use Breadth First Search traversal in reverse order,
i.e, From node1 to root. Same is done with node2. Then we find the LCA by the intersection of elements from array1 and array2. The first node returned
by the intersection is the LCA of the 2 nodes.
After installation, we can perform a merge the following way:
``
Contributing
We welcome anyone to use, test, or contribute back to this project.
We have extensive test coverage, but as we all know there's always bugs in software.
Please file issues or pull requests with your comments or suggestions.
Composer command for our command line client (download client)This client runs in each environment. You don't need a specific PHP version etc. The first 20 API calls are free.Standard composer command
The package relaxedws/lca contains the following files
Loading the files please wait ....
Loading please wait ...
Before you can download the PHP files, the dependencies should be resolved. This can take some minutes. Please be patient.