Were you asked about Euler paths, max flow, biconnected components, strongly connected components, cliques in Google or facebook interviews? Also which problems on graphs you felt complicated?
Have been asked to implement topological order. Not in G or FB though
What is topological order? Topo sort?
Yes
Connected components, yes. Rest no.
I've been asked topo sort in Google. Been asked a variety of medium graph problems - disguised cycle detection in Dir graph, bfs. Not the ones above (yet)
Yes. Google
Which problems?
Crack the safe, reconstruct itinerary