An almost Moore digraph denoted by -digraph is a diregular digraph of degree diameter and the number of vertices one less than the Moore bound. If u is a vertex of -digraph, then there exists a vertex v of -digraph such that there are two walks of length from u to v. The vertex v is called repeat of u and denoted by If distance u and their repeat is k, then u is called k-type of vertex, otherwise u is called 0-type vertex. This paper discusses the generalization of Baskoro’s et al. [5] results about the structure of out neighbor k-type and 0-type vertices. From this structure, we propose a conjecture which is still an open problem. Assuming the conjecture is true, we can show the nonexistence of almost digraphs for any and