This presentation discusses the motivation and current state of the art for Neighborhood-Aware Path Traversal in graph query languages. It proposes an approach that is rooted at introducing notations for references to neighborhood elements of the current edge being processed. Ideas are explained for new constructs that enable specification of constraints involving the properties of the neighborhood elements of an edge so that only those edges that satisfy the constraints are added to the path being created. Additional constructs are proposed for retrieval of path (aggregates), aggregate-based filter, and returning top-K paths based on specified criteria.