Design a site like this with
Get started

How To Implement Graph Using Java ?

If you are new to graph data structure , read article on graph introduction here. In this tutorial we will implement a bi-directional graph & uni-directional. We will actually be building an ADT(Abstract Data Type) for Graph ,which will host several functional features to be implemented on a graph. Let’s dive into the code directly: … Continue reading How To Implement Graph Using Java ?

Graph’s In Depth [PART 2]

In this article, we will discuss popular graph traversal algorithms. Before proceeding please read this article at first to get clear idea about graphs. Graph Traversals BFS (Breadth First Search) DFS (Depth First Search) Breadth First Search In the Breadth First Search, the traversal is done in a level wise manner. BFS uses Queue data … Continue reading Graph’s In Depth [PART 2]

Strings in Depth

Strings can be defined as a collection of characters with a null character (‘\0’) at the end. Strings are written in between double quotes for ex: “Welcome to C Programming”. Declaration of String The general form of declaring a string is char string_name[size]; where string_name is the name of the array & size specifies the … Continue reading Strings in Depth

Graph’s In Depth [PART 1]

Graph is a non linear data structure which consist of set of Edges & Vertices. They have applications in many fields of studies, Computer Networks are visualized through graphs, Internet is a one big example. Unlike Tree data structure,which is connected,graph may not always be connected. In the above graph:- V={A,B,C,D,E,F} E={(A,B),(A,D),(B,C),(C,D),(D,E),(E,F),(C,F)} Where V & … Continue reading Graph’s In Depth [PART 1]

Arrays In Depth

Arrays are one of the most basic data structures used today. Arrays can be defined as a data structure that holds the same group of elements, which are stored at contiguous memory locations. They are stored in contiguous memory locations to guarantee randomized access for a particular element. Arrays are best for fast lookup,i.e if … Continue reading Arrays In Depth