Suppose, we want to search for (1)-[edgeA]-(2)-[edgeB]-(3) efficiently where (1), (2) and (3) are nodes and we have two edges connecting between them [edgeA], [edgeB].
It
