No nonfinal states in NFA
Imagine an NFA with a single state, which is final/accepting. It has no edges.

This NFA accepts the language $\{\varepsilon\}$—that is, only the empty string. If it is given a non-empty string, it looks for appropriate edges leading away from the starting state, finds none, and fails.