Contents

//
// This file is part of the Bones source-to-source compiler examples. The C-code
// is largely identical in terms of functionality and variable naming to the code
// found in PolyBench/C version 3.2. For more information on PolyBench/C or Bones
// please use the contact information below.
//
// == More information on PolyBench/C
// Contact............Louis-Noel Pouchet <[e-mail]>
// Web address........http://polybench.sourceforge.net/
// 
// == More information on Bones
// Contact............Cedric Nugteren <[e-mail]>
// Web address........http://parse.ele.tue.nl/bones/
//
// == File information
// Filename...........benchmark/floyd-warshall.c
// Author.............Cedric Nugteren
// Last modified on...10-April-2012
//

#include "common.h"

// This is 'floyd-warshall', a graph analysis algorithm to find shortest paths in a weighted graph
int main(void) {
	int i,j,k;
	
	// Declare arrays on the stack
	float path[N][N];
	
	// Set the input data
	for (i=0; i<N; i++) {
		for (j=0; j<N; j++) {
			path[i][j] = ((float) (i+1)*(j+1)) / N;
		}
	}
	
	// Perform the computation
	for (k=0; k<N; k++) {
		for (i=0; i<N; i++) {
			for (j=0; j<N; j++) {
				path[i][j] = (path[i][j] < path[i][k]+path[k][j]) ? path[i][j] : path[i][k]+path[k][j];
			}
		}
	}
	
	// Clean-up and exit the function
	fflush(stdout);
	return 0;
}

Version data entries

1 entries across 1 versions & 1 rubygems

Version	Path
bones-compiler-1.1.0	examples/benchmarks/floyd-warshall.c