I was reading paper A Formal Basis for the Heuristics Determination of Minimum Cost Paths in section B "Some Definition About Graphs" there is footnote that say "We exclude the trivial case of $s \in T$" I don't get it, is it trivial like empty set? or have different meaning? You can see the paper in here
Sorry, if this question not appropriate.