What Graph topic to study | CS Career Hub | Page 1

empty dust Jun 27, 2022, 12:54 PM

#

I have finished studying BFS and DFS for Matrix, Graph, Tree. I realize there are more niche topic such as
Dijkstra's algorithm
union-find
minimum spanning tree
topological sort
Bellman Ford
Floyd Warshall
Eulearian Path
Should I study them ? Since the author of cracking coding interview said you don't need to.

https://www.quora.com/What-graph-topics-should-I-study-in-order-to-be-adequately-prepared-for-a-Google-software-engineer-interview-Would-it-be-worthwhile-to-also-study-algorithms-for-minimum-spanning-trees-maximum-network-flows-bipartite-matching-etc/answer/Gayle-Laakmann-McDowell

oblique wagon Jun 27, 2022, 3:36 PM

#

if you have a google interview, yes

#

actually, i'd say any big N that probably has a lot of graph-related problems

#

uber maybe, lyft, doordash, that sorta thing

empty dust Jun 27, 2022, 7:59 PM

#

oblique wagon actually, i'd say any big N that probably has a lot of graph-related problems

well that's a lot of algorithm to learn, memorize, and improvise. thanks

#

blobnotlikethis

frozen thistle Jun 28, 2022, 1:46 AM

#

https://hbcuconnect.com/ads/google/GoogleSE.pdf
According to this the only thing you have listed that you need is Dijkstra's if you're doing a google interview
Make sure you know your basics really well before you delve into more niche topics. Most companies are looking to see how you solve a problem with what you know and not "do they know this obscure thing"

#What Graph topic to study