adapt Bellman Ford algorithm to find shortest paths with, possibly, negative cycles.

adapt Bellman Ford algorithm to find negative cycles reachable from s

A Brute Force method to return the smallest distance between two points in P[] of size n

Build a heap from ``data`` inplace. Returns a sequence of swaps performed by the algorithm.

Build suffix array of the string text and return a list result of the same length as the text such that the value result[i] is the index (0-bas

Build suffix array of the string text and return a list result of the same length as the text such that the value result[i] is the index (0-bas

Build a suffix tree of the string text and return a list with all of the labels of its edges (the corresponding substrings of the text) in any

Initialize the data structures before new query, clear the changes made by the previous query.

The main functin that finds the smallest distance This method mainly uses closestUtil()

A recursive function to find the smallest distance. The array P contains all points sorted according to x coordinate

Adaptation of Kruskal's algorithm Kruskal's algorithm starts with each vertex as a disjoint set The basic idea is to run the algo until only k disjoin

Dijkstra's algorithm to compute weighted distance fron node s

Find all the occurrences of the pattern in the text and return a list of all positions in the text where the pattern starts in the text.