Gets the Longest Common Subsequence for the given Node arrays. "Matched" Nodes are considered equal. The returned nodes are from s1. TODO: Check for better algorithms @param s1 First Node sequence @param s2 Second Node sequence @param matchings Set of matching Nodes @return A list of Nodes repres
(final Node[] s1, final Node[] s2,
final NodePairs matchings)
source not stored for this graph (policy: none)