We study different classes of digraphs, which are generalizations of tournaments, to have the property of possessing a maximal independent set intersecting every non-augmentable or every longest path. The classes are the arc-local tournament, quasi-transitive, path-mergeable, locally insemicomplete (out-semicomplete), and semicomplete k-partite digraphs. A short survey is included in the introduction.