Real time flow control breadth first search algorithm

The modified assembly line search algorithm exhibits many desirable attributes of a minimal search algorithm. Having the ability efficiently handle cycles and branching with in the graph as well as graph situations where the start node and end nodes are no connected by a path. The modified assembly line algorithm is a complete search algorithm in its ability to find the path, if one exists, and the first path it finds will be the minimal cost path.;Separation of the implemented functionality and the data itself facilitates in the implementation of this algorithm in a number of environments. The only requirement is nodes and edges are assigned non-negative costs.;Due to the algorithm's small memory footprint and discrete modular design it is well adapted for implementation as a service into a middleware server. As well through its design updates are performed in a spatially localized area in an inherently transactional manner.;Additional research is needed to implement the search algorithm as a minimal cost path search service in a middleware environment. In the middleware environment input devices would transmit there data and event to an asynchronous message queue where they would be processed by updating the data matrix and recalculating the minimal cost path using the parent and child nodes of the node reporting the change.