Question d’entretien chez Uber

Write an algorithm which checks for cyclical dependencies in a graph