Determinantal ideals of graphs are the ideals generated by the k-minors of matrices whose entries are in a polynomial ring obtained from the combinatorial properties of a graph. Determinantal ideals have been the central topic in both commutative algebra and algebraic geometry, and they also have numerous connections with invariant theory, representation theory, and combinatorics. These determinantal ideals generalize the spectrum and the Smith normal form (SNF) of matrices associated with graphs. Since matrices associated with graphs play a crucial role in designing networks, developing routing algorithms, and optimizing data transmission, then the reader will find in determinantal ideals promising applications in network theory, optimization, complex networks, among others. This brief survey focuses on two determinantal ideals: critical ideals and distance ideals. Critical ideals have been used to obtain characterizations of graphs with a fixed number of generators and to calculate the sandpile groups of some families of graphs. Furthermore, there are relations between critical ideals and the concepts of zero-forcing number and minimum rank. On the other hand, in this survey, characterizations of graphs and digraphs with one trivial distance ideal are given. These characterizations have interesting relations with well-known families of graphs, like distance-hereditary and perfect graphs. Also, the concept of cospectrality can be extended to determinantal ideals.