Graphs in CS and its traversal #algorithms
▻https://hackernoon.com/graphs-in-cs-and-its-traversal-algorithms-cfee5533f74e?source=rss----3a8
The vast majority of algorithms of interest operate on data. Therefore, there are particular ways of organizing data that play a critical role in the design and analysis of algorithms. From that, we can say that data structures are simply ways of organizing data.They are either linear or non-linear. Arrays and linked lists are examples of linear data structures. On the other hand, graphs and trees are forms of non-linear data structures.For example, one common data structure is the list or array, which is an ordered sequence of values. Here’s a list of numbers: 0, 1, 1, 2, 3, 5, 8, 13. The concept of the list isn’t particular to one language, and it’s also used outside of #programming in everyday life — wish lists, shopping lists, and so on.Algorithms are recipes for getting things done. They (...)