Author: Unknown
Subject: Hwk5 algorithm
Date: Friday, 17 Apr 2020, 11:56:10

In the spec, you say "let N be the number of moves associated with P in the search table." Do we find this by searching for P in the search table, finding its reachedFrom, searching for its reachedFrom in the search table, and so on until we find the initial triple (indicated by a null reachedFrom) and counting the number of triples we come across? If so, do we count P in N?