# ALGORITHMS

#### Solving Graph Problems (Part 3) - Dijkstra

Problem Source: UVA Online Judge - 10986

Brief Analysis: As a first problem of Dijkstra, a very straight-forward problem chosen. Just read and code.

#### Solving Graph Problems (Part 4) - Floyd-Warshall

Problem Source: UVA Online Judge - 567

Brief Analysis: As a first problem of Floyd-Warshall, a very straight-forward problem chosen. Just read and code.

#### Bipartite Graph Check Bipartite Graph Check is quite easy and can be implemented using BFS or DFS. I am assuming you already know what is Bipartite Graph. There is one critical case that comes in my mind right now is following one: Now I will show a DFS based implemention of bipartite check. You might already know...

#### Bitwise Operations (Part-1)

##### ALL_BITS:

Getting an integer with all bits set. Following expression will provide us an integer of 31 bits where all bits set. Maximum positive integer of `**int**` data type.

`(1 << 31) - 1`

``#define ALL_BITS                 ((1 << 31) - 1)``
##### NEG_BITS:

Given an integer N, generate a new intege... 