Breadth-First Search (BFS) and Depth-First Search (DFS) are algorithms for traversing graphs. Traversal is the process of accessing each vertex (node) of a data structure in a systematic well-defined order. Choosing the algorithm depends on the type of data you are dealing with. There are generally two types of traversal and the main difference between

2019-10-24T21:47:52+03:00By |Categories: Explained Simply|Tags: , |2 Comments

Trees vs. Graphs

Trees and graphs are data structures used to resolve various complex problems. Knowing the difference between them is useful in terms of better understanding of the non-linear way of storing data. Definition: Trees and graphs are both abstract data structures. They are a non-linear collection of objects, which means that there is no sequence between

2019-04-07T13:20:21+03:00By |Categories: Explained Simply|Tags: , |0 Comments
Go to Top