Tag: graph

breadth-first search graph

Breadth-First Search Algorithm with Java

The Breadth-First search algorithm is a way to traverse through graphs or trees so that the nodes are visited level by level.  The depth-first search algorithm, on the other hand, will traverse nodes to the depth-first as its name suggests, in other...

Depth First Search

Depth-First-Search with Java

The depth-first-search algorithm is used a lot in algorithms where it’s necessary to traverse through nodes. In day-to-day work, this algorithm is very likely to not be used though. However, LinkedList uses the concepts of graphs. But before...

Tree Data Structure

Tree Data Structure with Java

The tree data structure is a type of graph. A tree has a root node (top node) that will have a relationship with its child nodes. The path that connects the root node to the child nodes is called a branch. The leaf node is the node that...

Graph data structure

Graph Data Structure with Java

The graph data structure is a composition of nodes connected by edges. Graphs are vastly used in the real world. One very simple example is Facebook where a person is a friend of another person and so on. Graphs can also represent routes from one...

Stand Out as a Java Developer and Get Your Dream Job!

You will get the book by email in a few minutes after registering.