The method returns the cost for the join between
two triples for this heuristic, since there is no
joined triple pattern concept for variable counting.
The method allows a retrieval of a GraphEdge, a specific
edge of the ConnectedGraph by given the two triples which
correspond to the nodes of the edge.
Return the optimized list of GraphEdge objects,
The method returns null if the ConnectedGraph is not
yet optimized, i.e. the method optimize() is not yet
executed.
The heuristic is an implementation of the SEI / QPI approaches
by Bernstein et al. developed at the Department of Informatics,
University of Zurich within the MSc thesis of Markus Stocker.