amlan@stearns:~/NVIDIA_GPU_Computing_SDK_old/C/src/amlan_C/computationOnRealWorldGraphs/TexasRoadNetwork/CorrectAnalysis$ gcc -o heuristic bfsHeuristic.c 
amlan@stearns:~/NVIDIA_GPU_Computing_SDK_old/C/src/amlan_C/computationOnRealWorldGraphs/TexasRoadNetwork/CorrectAnalysis$ ./heuristic 
Welcome to Texas Road Network data analysis....
Number of items read from file: 1400000, edited number: 1400000 
Total number of directed edges in the graph: 0 out of 3843320
The total number of levels in the BFS: 723
The level with the maximum number of nodes in the BFS: 366, with 4426 nodes 

Starting with node 0, total Number of vertices Visited : 1351137 
Two consecutive levels with the maximum number of nodes in the BFS: 366 and 367, with 8782 nodes 
Three consecutive levels with the maximum number of nodes in the BFS: 365, 366 and 367, with 13122 nodes 
The total number of combinations to be tested: 13086216846438
The number of tests considering 2 adjacent levles with max. nodes: 112844572460
The total number of components: 2033
The maximum number of nodes in a connected component: 73
The number of nodes in all connected component: 8782
The number of tests considering 2 adjacent levles component with max. nodes: 62196



*******************************************************************************************************************************
*******************************************************************************************************************************

amlan@stearns:~/NVIDIA_GPU_Computing_SDK_old/C/src/amlan_C/computationOnRealWorldGraphs/PennsylvaniaRoadNetwork$ gcc -o heuristic bfsTreeHeuristic.c 
amlan@stearns:~/NVIDIA_GPU_Computing_SDK_old/C/src/amlan_C/computationOnRealWorldGraphs/PennsylvaniaRoadNetwork$ ./heuristic 
Welcome to Pennsylvania Road Network data analysis....
Number of items read from file: 1100000, edited number: 1100000 
Total condensed to: 1100000
Total number of directed edges in the graph: 0 out of 3083796
The total number of levels in the BFS: 557
The level with the maximum number of nodes in the BFS: 268, with 4057 nodes 

Starting with node 6, total Number of vertices Visited : 1087562 
Two consecutive levels with the maximum number of nodes in the BFS: 267 and 268, with 8108 nodes 
Three consecutive levels with the maximum number of nodes in the BFS: 267, 268 and 269, with 12130 nodes 
The total number of combinations to be tested: 9205246409817
The number of tests considering 2 adjacent levles with max. nodes: 88803332156
The total number of components: 1871
The maximum number of nodes in a connected component: 132
The number of nodes in all connected component: 8108
The number of tests considering 2 adjacent levles component with max. nodes: 374660



*******************************************************************************************************************************
*******************************************************************************************************************************




amlan@stearns:~/NVIDIA_GPU_Computing_SDK_old/C/src/amlan_C/computationOnRealWorldGraphs/CaliforniaRoadNetwork$ ./heuristic 
Welcome to California Road Network data analysis....
Number of items read from file: 1980000, edited number: 1980000 
Total number of directed edges in the graph: 0 out of 5533214
The total number of levels in the BFS: 557
The level with the maximum number of nodes in the BFS: 215, with 6115 nodes 

Starting with node 6, total Number of vertices Visited : 1957027 
Two consecutive levels with the maximum number of nodes in the BFS: 214 and 215, with 12180 nodes 
Three consecutive levels with the maximum number of nodes in the BFS: 213, 214 and 215, with 18258 nodes 
The total number of combinations to be tested: 49782226087056
The number of tests considering 2 adjacent levles with max. nodes: 301081199860
The total number of components: 3193
The maximum number of nodes in a connected component: 60
The number of nodes in all connected component: 12180
The number of tests considering 2 adjacent levles component with max. nodes: 34220



*******************************************************************************************************************************
*******************************************************************************************************************************


amlan@stearns:~/NVIDIA_GPU_Computing_SDK_old/C/src/amlan_C/computationOnRealWorldGraphs/EmailEnron$ gcc -o heuristic bfsHeuristic.c 
amlan@stearns:~/NVIDIA_GPU_Computing_SDK_old/C/src/amlan_C/computationOnRealWorldGraphs/EmailEnron$ ./heuristic 
Welcome to Enron Email data analysis....
Number of items read from file: 36692, edited number: 36692 
Total number of directed edges in the graph: 0 out of 367662
The total number of levels in the BFS: 9
The level with the maximum number of nodes in the BFS: 4, with 16114 nodes 

Starting with node 6, total Number of vertices Visited : 33696 
Two consecutive levels with the maximum number of nodes in the BFS: 4 and 5, with 30167 nodes 
Three consecutive levels with the maximum number of nodes in the BFS: 4, 5 and 6, with 32328 nodes 
The total number of combinations to be tested: 4963762814975
The number of tests considering 2 adjacent levles with max. nodes: 4575114097355
The total number of components: 4455
The maximum number of nodes in a connected component: 24512
The number of nodes in all connected component: 30167
The number of tests considering 2 adjacent levles component with max. nodes: 2454323686720



*******************************************************************************************************************************
*******************************************************************************************************************************


amlan@stearns:~/NVIDIA_GPU_Computing_SDK_old/C/src/amlan_C/computationOnRealWorldGraphs/InternetTopology$ gcc -o heuristic bfsHeuristic.c 
amlan@stearns:~/NVIDIA_GPU_Computing_SDK_old/C/src/amlan_C/computationOnRealWorldGraphs/InternetTopology$ ./heuristic 
The total number of edges using Neighbor data: 22190596
The total number of elements in the file: 22190596
Total Number of vertices: 1696415 
Total Number of edges: 22190596 
Maximum number of neighbors for a single vertex: 35455 , for node: 7046
The total number of vertices with identifier not O: 20493803
The total number of levels in the BFS: 22
The level with the maximum number of nodes in the BFS: 5, with 748276 nodes 
Total number of nodes visited: 1694616 starting with node 1710000
Two consecutive levels with the maximum number of nodes in the BFS: 4 and 5, with 1299877 nodes 
Three consecutive levels with the maximum number of nodes in the BFS: 4, 5 and 6, with 1623942 nodes 
TOtal number of nodes visited: 1694616 
The total number of components: 10539
The maximum number of nodes in a connected component: 1287183
The number of nodes in all connected component: 1299877
The total number of combinations to be tested: 506312406519051418
The number of tests considering 2 adjacent levles with max. nodes: 366061896660532250
The number of tests considering 2 adjacent levles component with max. nodes: 355441901395084231



*******************************************************************************************************************************
*******************************************************************************************************************************



amlan@stearns:~/NVIDIA_GPU_Computing_SDK_old/C/src/amlan_C/computationOnRealWorldGraphs/FacebookSocialCircles$ gcc -o BFS bfsHeuristic.c 
amlan@stearns:~/NVIDIA_GPU_Computing_SDK_old/C/src/amlan_C/computationOnRealWorldGraphs/FacebookSocialCircles$ ./BFS
Welcome to Facebook Social Circles data analysis....
Number of items read from file: 4039, edited number: 4039 
Total condensed to: 4039
Total number of directed edges in the graph: 0 out of 176468
The total number of levels in the BFS: 7
The level with the maximum number of nodes in the BFS: 4, with 1742 nodes 

Starting with node 0, total Number of vertices Visited : 4039 
Two consecutive levels with the maximum number of nodes in the BFS: 3 and 4, with 2913 nodes 
Three consecutive levels with the maximum number of nodes in the BFS: 3, 4 and 5, with 3432 nodes 
The total number of combinations to be tested: 5496457108
The number of tests considering 2 adjacent levles with max. nodes: 4115501936
The total number of components: 13
The maximum number of nodes in a connected component: 2900
The number of nodes in all connected component: 2913
The number of tests considering 2 adjacent levles component with max. nodes: 4060629300


*******************************************************************************************************************************
*******************************************************************************************************************************





