Perguntas de entrevista para o cargo de engenheiro compartilhadas pelos candidatos
Given a file that represent a graph, write an algorithm that compute the number of triangles in the graph.
I didn't finished this one.
What about running BFS and check how many edges connect nodes on the same level.
What about running a DFS on every node looking for an egde that connects to the original vertex in the third depth? Running time would be O (n2 + nm) )