Download the PHP package mathieuviossat/fibonacci-heap without Composer

On this page you can find all versions of the php package mathieuviossat/fibonacci-heap. It is possible to download/install these versions without Composer. Possible dependencies are resolved automatically.

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.
Please rate this library. Is it a good library?

Informations about the package fibonacci-heap

Fibonacci heap

The Fibonacci heap is a heap data structure with the best amortized running time. It was developed by Michael L. Fredman and Robert E. Tarjan in 1984. The running time of Dijkstra's algorithm can be improved to O(|E| + |V| log |V|) by using a Fibonacci heap.

Installation

Example

Methods

minimum() : FibonacciHeapElement

Returns the element with the lowest key, or null if the heap is empty.
Complexity: Θ(1)

insert(int|float $key, mixed $data) : FibonacciHeapElement

Inserts $data with the priority $key in the heap and return the element.
Complexity: Θ(1)

extractMin() : FibonacciHeapElement

Deletes the element with the lowest priority from the heap and return it.
Amortized complexity: O(log n)

decreaseKey(FibonacciHeapElement $element, int|float $key) : void

Replaces $element's key by $key. $key must be lower than the old key.
Amortized complexity: Θ(1)

delete(FibonacciHeapElement $element) : void

Deletes $element from the heap.
Amortized complexity: O(log n)

merge(FibonacciHeap $other) : void

Merges the both heaps. I recommend to only use one of them after that.
Complexity: Θ(1)

isEmpty() : bool

Retuns true if the heap is empty, false otherwise.
Complexity: Θ(1)

size() / count() / count($heap) : int

Retuns the number of elements in the heap.
Complexity: Θ(1)

clear() : void

Removes all elements from the heap.
Complexity: Θ(1)

License

This library is published under The MIT License.


All versions of fibonacci-heap with dependencies

PHP Build Version
Package Version
Requires php Version >=5.3.0
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 mathieuviossat/fibonacci-heap contains the following files

Loading the files please wait ....