Graph Implementation in C++ (without using STL)

Given an undirected or a directed graph, implement the graph data structure without using any container provided by any programming language library (e.g. STL in C++ or Collections in Java, etc). Implement for both weighted and unweighted graphs using Adjacency List representation.

Graph Implementation in C++ using STL

Given an undirected or a directed graph, implement graph data structure in C++ using STL. Implement for both weighted and unweighted graphs using Adjacency List representation of the graph.

Implement Graph Data Structure in C

In this post we will see how to implement graph data structure in C using Adjacency List. This post will cover both weighted and unweighted implementation of directed and undirected graphs.

Terminology and Representations of Graphs

This post discuss the basic definitions in terminologies associated with graphs and covers adjacency list and adjacency matrix representations of the graph data structure.   What is a Graph? A graph is an ordered pair G = (V, E) comprising a set V of vertices or nodes and a collection of pairs of vertices from V …

Concatenate Multiple Lists in Java

In this article, several methods to concatenate multiple lists in Java into a single list are discussed using plain Java, Java 8, Guava Library and Apache Commons Collections.

Convert a Set to Stream in Java 8

In this post, we will see how to convert a set to stream in Java 8. We will also learn how to apply filters on a stream and convert stream back to a set or list.