ArtsAutosBooksBusinessEducationEntertainmentFamilyFashionFoodGamesGenderHealthHolidaysHomeHubPagesPersonal FinancePetsPoliticsReligionSportsTechnologyTravel

Floyd's algorithm source code in C

Updated on September 19, 2011

Algorithm

The Floyd–Warshall algorithm compares all possible paths through the graph between each pair of vertices. It is able to do this with only Θ(|V|3) comparisons in a graph. This is remarkable considering that there may be up to Ω(|V|2) edges in the graph, and every combination of edges is tested. It does so by incrementally improving an estimate on the shortest path between two vertices, until the estimate is optimal.

Consider a graph G with vertices V, each numbered 1 through N. Further consider a function shortestPath(i, j, k) that returns the shortest possible path from i to j using vertices only from the set {1,2,...,k} as intermediate points along the way. Now, given this function, our goal is to find the shortest path from each i to each j using only vertices 1 to k + 1.

There are two candidates for each of these paths: either the true shortest path only uses vertices in the set {1, ..., k}; or there exists some path that goes from i to k + 1, then from k + 1 to j that is better. We know that the best path from i to j that only uses vertices 1 through k is defined by shortestPath(i, j, k), and it is clear that if there were a better path from i to k + 1 to j, then the length of this path would be the concatenation of the shortest path from i to k + 1 (using vertices in {1, ..., k}) and the shortest path from k + 1 to j(also using vertices in {1, ..., k}).

If w(i,j) is the weight of the edge between vertices i and j, we can define shortestPath(i, j, k) in terms of the following recursive formula: the base case is

shortestPath(i,j,0) = w(i,j)

and the recursive case is

This formula is the heart of the Floyd–Warshall algorithm. The algorithm works by first computing shortestPath(i, j, k) for all (i, j) pairs for k = 1, then k = 2, etc. This process continues until k = n, and we have found the shortest path for all (i, j) pairs using any intermediate vertices.

Floyd's Algorithm

/*C PROGRAM TO IMPLEMENT ALL PAIR SHORTEST PATH USING FLOYDS ALGORITHM

INPUT: N VALUE FOR NUMBER OF VERTICES

OUTPUT: ADJACENCY MATRIX
SHORTEST DISTANCE MATRIX
*/

#include<stdio.h>
#include<stdlib.h>

void AdjacencyMatrix(int a[][100],int n){ //To generate adjacency matrix for given nodes

int i,j;
for(i = 0;i < n; i++)
{
for(j = 0;j <= n; j++)
{
a[i][j] = 0;
}

}

for(i = 1; i < n; i++)
{
for(j=0;j<i;j++)
{
a[i][j] = rand()%10;
a[j][i] = 99;
}
}
}


int min(int a,int b){

if(a < b)
return a;
else
return b;
}

void floyds(int a[][100],int n){

int i,j,k;
for(k = 0;k < n ; k++)
{
for(i = 0;i < n; i++)
{
for(j = 0;j < n ; j++)
{
a[i][j] = min (a[i][j], a[i][k] + a[k][j] );
}
}
}

}

int main()
{
int a[100][100],n,i,j;

FILE *fp = fopen("floyds.dot","w"); /* FOR DIGRAPH */

fprintf(fp,"digraph A {\n"); /* WRITE TO FILE */

printf("Enter the vertices of the digraph\n");
scanf("%d",&n);

AdjacencyMatrix(a,n);

printf("\t\tAdjacency Matrix of the graph\n"); /* PRINT ADJACENCY MATRIX */
for(i = 0;i < n; i++)
{
for(j = 0;j < n; j++)
{
printf("\t%d",a[i][j]);
if(a[i][j] != 0)
{
fprintf(fp,"%d -> %d\n",i,j);
}
}
printf("\n");
}

floyds(a,n);

printf("\n Shortest distance matrix\n"); /*PRINT SHORTEST DISTANCE MATRIX*/
for(i = 0;i < n; i++)
{
for(j = 0;j < n; j++)
{
printf("\t%d",a[i][j]);
}
printf("\n");
}

fprintf(fp,"}\n\n");

fclose(fp);

return 0;
}

Comments

    0 of 8192 characters used
    Post Comment

    • profile image

      namratha 

      5 years ago

      i wanted code for floyd algorithm using openGL

    • prabhakar gouda profile imageAUTHOR

      prabhakar gouda 

      6 years ago from Bangalore

      Hi Rick,

      a[][100] is an adjacent matrix, and 'n' is the number of rows/columns in adjacent matrix. In other words 'n' represents the number of node in a graph.

      Ex:

      Consider an adjacency matrix:

      0 1 2

      1 0 2

      9 8 0

      Here n=3

      first rows says distance from 1st node to all other nodes.

      Second rows represents distance from 2nd node to all other nodes.

      In my code i generated random adjacency matrix, if you want to calculate shorted distance for your matrix then please comment random matrix generation part and take manual input.

    • profile image

      Rick G 

      6 years ago

      Concerning floyds(int a[][100],int n).

      What does 'a' and represent and what does each of the two dimensions of a represent?

      What does 'n' represent?

      I have a list of locations, with a list of connections between those locations and the distance associated with those connections. I need to find shortest path for any given two locations - but need to understand how to apply "floyds(int a[][100],int n)" to it.

    • profile image

      santhosh 

      8 years ago

      good.... helps in lab

    working

    This website uses cookies

    As a user in the EEA, your approval is needed on a few things. To provide a better website experience, hubpages.com uses cookies (and other similar technologies) and may collect, process, and share personal data. Please choose which areas of our service you consent to our doing so.

    For more information on managing or withdrawing consents and how we handle data, visit our Privacy Policy at: https://hubpages.com/privacy-policy#gdpr

    Show Details
    Necessary
    HubPages Device IDThis is used to identify particular browsers or devices when the access the service, and is used for security reasons.
    LoginThis is necessary to sign in to the HubPages Service.
    Google RecaptchaThis is used to prevent bots and spam. (Privacy Policy)
    AkismetThis is used to detect comment spam. (Privacy Policy)
    HubPages Google AnalyticsThis is used to provide data on traffic to our website, all personally identifyable data is anonymized. (Privacy Policy)
    HubPages Traffic PixelThis is used to collect data on traffic to articles and other pages on our site. Unless you are signed in to a HubPages account, all personally identifiable information is anonymized.
    Amazon Web ServicesThis is a cloud services platform that we used to host our service. (Privacy Policy)
    CloudflareThis is a cloud CDN service that we use to efficiently deliver files required for our service to operate such as javascript, cascading style sheets, images, and videos. (Privacy Policy)
    Google Hosted LibrariesJavascript software libraries such as jQuery are loaded at endpoints on the googleapis.com or gstatic.com domains, for performance and efficiency reasons. (Privacy Policy)
    Features
    Google Custom SearchThis is feature allows you to search the site. (Privacy Policy)
    Google MapsSome articles have Google Maps embedded in them. (Privacy Policy)
    Google ChartsThis is used to display charts and graphs on articles and the author center. (Privacy Policy)
    Google AdSense Host APIThis service allows you to sign up for or associate a Google AdSense account with HubPages, so that you can earn money from ads on your articles. No data is shared unless you engage with this feature. (Privacy Policy)
    Google YouTubeSome articles have YouTube videos embedded in them. (Privacy Policy)
    VimeoSome articles have Vimeo videos embedded in them. (Privacy Policy)
    PaypalThis is used for a registered author who enrolls in the HubPages Earnings program and requests to be paid via PayPal. No data is shared with Paypal unless you engage with this feature. (Privacy Policy)
    Facebook LoginYou can use this to streamline signing up for, or signing in to your Hubpages account. No data is shared with Facebook unless you engage with this feature. (Privacy Policy)
    MavenThis supports the Maven widget and search functionality. (Privacy Policy)
    Marketing
    Google AdSenseThis is an ad network. (Privacy Policy)
    Google DoubleClickGoogle provides ad serving technology and runs an ad network. (Privacy Policy)
    Index ExchangeThis is an ad network. (Privacy Policy)
    SovrnThis is an ad network. (Privacy Policy)
    Facebook AdsThis is an ad network. (Privacy Policy)
    Amazon Unified Ad MarketplaceThis is an ad network. (Privacy Policy)
    AppNexusThis is an ad network. (Privacy Policy)
    OpenxThis is an ad network. (Privacy Policy)
    Rubicon ProjectThis is an ad network. (Privacy Policy)
    TripleLiftThis is an ad network. (Privacy Policy)
    Say MediaWe partner with Say Media to deliver ad campaigns on our sites. (Privacy Policy)
    Remarketing PixelsWe may use remarketing pixels from advertising networks such as Google AdWords, Bing Ads, and Facebook in order to advertise the HubPages Service to people that have visited our sites.
    Conversion Tracking PixelsWe may use conversion tracking pixels from advertising networks such as Google AdWords, Bing Ads, and Facebook in order to identify when an advertisement has successfully resulted in the desired action, such as signing up for the HubPages Service or publishing an article on the HubPages Service.
    Statistics
    Author Google AnalyticsThis is used to provide traffic data and reports to the authors of articles on the HubPages Service. (Privacy Policy)
    ComscoreComScore is a media measurement and analytics company providing marketing data and analytics to enterprises, media and advertising agencies, and publishers. Non-consent will result in ComScore only processing obfuscated personal data. (Privacy Policy)
    Amazon Tracking PixelSome articles display amazon products as part of the Amazon Affiliate program, this pixel provides traffic statistics for those products (Privacy Policy)