Tries to find paths in a graph from a start node to an end node where the length of found paths must be of a certain length. It also detects "super nodes", i.e. nodes which have many relationships and only iterates over such super nodes' relationships up to a supplied threshold. When that threshold is reached such nodes are considered super nodes and are put on a queue for later traversal. This makes it possible to find paths w/o having to traverse heavy super nodes.
@author Mattias Persson
@author Tobias Ivarsson
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.