The **n queens puzzle** is the problem of placing eight chess queens on an n×n chessboard so that no two queens threaten each other. Thus, a solution requires that no two queens share the same row, column, or diagonal.

# Category Archives: Snippets

# Implementing 0-1 Knapsack in Java

The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a mass and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.

In 0-1 Knapsack, the restriction is that, one cannot select fraction of any item. He/She must select either whole item or try with alternate one.

Continue reading Implementing 0-1 Knapsack in Java# Implementation of Multi-Stage Graph in Java

# Implementation of All Pair Shortest Path Algorithm

All pair shortest path algorithm is used to find shortest distance between each pair of vertices.

Continue reading Implementation of All Pair Shortest Path Algorithm# Constructing The Minimum Spanning Tree for a Graph using Kruskal’s Algorithm

Kruskal’s algorithm is a minimum-spanning-tree algorithm where the algorithm finds an edge of the least possible weight that connects any two trees in the forest. It is a greedy algorithm in graph theory as it finds a minimum spanning tree for a connected weighted graph at each step.

Continue reading Constructing The Minimum Spanning Tree for a Graph using Kruskal’s Algorithm# Constructing The Minimum Spanning Tree for a Graph using Prim’s Algorithm

Prim’s algorithm is a greedy algorithm that finds a minimum spanning tree for a connected weighted undirected graph.

Continue reading Constructing The Minimum Spanning Tree for a Graph using Prim’s Algorithm