Skilled Coder (@theskilledcoder) on Piclur: Graph Algorithms Summarized / Piclur

Skilled Coder

@theskilledcoder

Nov 7

Graph Algorithms Summarized

Himanshu Kumar

@codewithimanshu

Nov 7

Skilled, your summary sounds good, but graph algorithms are actually quite complex, no? Still, a great starting point!

*Note: in context of G: traversing / ordering(sorting) / searching essentially fall under same topic. *Detecting cycle is just special case of this heading - where you detect that there exists a cycle. *Well implemented toposort returns -1(false) for a cyclic graph input.

never4g8's tweet image. *Note: in context of G: traversing / ordering(sorting) / searching essentially fall under same topic.
*Detecting cycle is just special case of this heading - where you detect that there exists a cycle.
*Well implemented toposort returns -1(false) for a cyclic graph input.

Never Forget

@never4g8

Nov 8

- all traversal algo can be summarised using single algo. - The design of bag dictatces order of traversal - if bag = stack : DFS - if bag = queue : BFS bag can be a priority queue

never4g8's tweet image. - all traversal algo can be summarised using single algo.
- The design of bag dictatces order of traversal
- if bag = stack : DFS
- if bag = queue : BFS
bag can be a priority queue

Iffearl

@iffearl

Nov 8

Most of these algorithms arent needed for basic dev and if you really need some of these advanced algorithms then you will not have sufficient knowledge with only some of them. There are also no Flow algorithms which are very useful