In this paper, we analyze the relation between Leibniz algebras and combinatorial structures. More concretely, we study the properties to be satisfied by (pseudo)digraphs so that they are associated with low-dimensional Leibniz algebras. We present some results related to
this association and show an algorithmic method to obtain them, which has been implemented with Maple
