Warshall's algorithm is used to find the transitive closure of a graph. It's one of the efficient method to compute closure path that can be produced. Transitive closure is an important application in graph theory in computer science.

The following provides the source codes for implementing the Warshall's algorithm:

```
//.............................USE OF WARSHALL'S ALGORITHM TO CREATE TRANSITIVE CLOSURE OF A GRAPH..........
#include<iostream>
#include<conio.h>
using namespace std;
const int num_nodes =10;
int main()
{
//..............................................................VARIABLE DECLARATION
int num_nodes,k,n;
char i,j,res,c;
int adj[10][10],path[10][10];
```