algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-26 22:14:08 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format code with prettier (#3375)

Browse Source
This commit is contained in:
acbin
2022-10-03 17:23:00 +08:00
committed by GitHub
parent 32b9b11ed5
commit e96f567bfc
464 changed files with 11483 additions and 6189 deletions
Download Patch File Download Diff File Expand all files Collapse all files

55
src/main/java/com/thealgorithms/others/PageRank.java
View File

@ -10,7 +10,9 @@ class PageRank {
System.out.print("Enter the Number of WebPages: ");
nodes = in.nextInt();
PageRank p = new PageRank();
System.out.println("Enter the Adjacency Matrix with 1->PATH & 0->NO PATH Between two WebPages: ");
System.out.println(
"Enter the Adjacency Matrix with 1->PATH & 0->NO PATH Between two WebPages: "
);
for (i = 1; i <= nodes; i++) {
for (j = 1; j <= nodes; j++) {
p.path[i][j] = in.nextInt();
@ -26,7 +28,6 @@ class PageRank {
public double pagerank[] = new double[10];
public void calc(double totalNodes) {
double InitialPageRank;
double OutgoingLinks = 0;
double DampingFactor = 0.85;
@ -37,7 +38,12 @@ class PageRank {
int ITERATION_STEP = 1;
InitialPageRank = 1 / totalNodes;
System.out.printf(
" Total Number of Nodes :" + totalNodes + "\t Initial PageRank of All Nodes :" + InitialPageRank + "\n");
" Total Number of Nodes :" +
totalNodes +
"\t Initial PageRank of All Nodes :" +
InitialPageRank +
"\n"
);
// 0th ITERATION _ OR _ INITIALIZATION PHASE //
for (k = 1; k <= totalNodes; k++) {
@ -46,20 +52,31 @@ class PageRank {
System.out.printf("\n Initial PageRank Values , 0th Step \n");
for (k = 1; k <= totalNodes; k++) {
System.out.printf(" Page Rank of " + k + " is :\t" + this.pagerank[k] + "\n");
System.out.printf(
" Page Rank of " + k + " is :\t" + this.pagerank[k] + "\n"
);
}
while (ITERATION_STEP <= 2) // Iterations
{
while (ITERATION_STEP <= 2) { // Iterations
// Store the PageRank for All Nodes in Temporary Array
for (k = 1; k <= totalNodes; k++) {
TempPageRank[k] = this.pagerank[k];
this.pagerank[k] = 0;
}
for (InternalNodeNumber = 1; InternalNodeNumber <= totalNodes; InternalNodeNumber++) {
for (ExternalNodeNumber = 1; ExternalNodeNumber <= totalNodes; ExternalNodeNumber++) {
if (this.path[ExternalNodeNumber][InternalNodeNumber] == 1) {
for (
InternalNodeNumber = 1;
InternalNodeNumber <= totalNodes;
InternalNodeNumber++
) {
for (
ExternalNodeNumber = 1;
ExternalNodeNumber <= totalNodes;
ExternalNodeNumber++
) {
if (
this.path[ExternalNodeNumber][InternalNodeNumber] == 1
) {
k = 1;
OutgoingLinks = 0; // Count the Number of Outgoing Links for each ExternalNodeNumber
while (k <= totalNodes) {
@ -69,13 +86,21 @@ class PageRank {
k = k + 1;
}
// Calculate PageRank
this.pagerank[InternalNodeNumber] += TempPageRank[ExternalNodeNumber] * (1 / OutgoingLinks);
this.pagerank[InternalNodeNumber] +=
TempPageRank[ExternalNodeNumber] *
(1 / OutgoingLinks);
}
}
System.out.printf("\n After " + ITERATION_STEP + "th Step \n");
for (k = 1; k <= totalNodes; k++) {
System.out.printf(" Page Rank of " + k + " is :\t" + this.pagerank[k] + "\n");
System.out.printf(
" Page Rank of " +
k +
" is :\t" +
this.pagerank[k] +
"\n"
);
}
ITERATION_STEP = ITERATION_STEP + 1;
@ -83,15 +108,17 @@ class PageRank {
// Add the Damping Factor to PageRank
for (k = 1; k <= totalNodes; k++) {
this.pagerank[k] = (1 - DampingFactor) + DampingFactor * this.pagerank[k];
this.pagerank[k] =
(1 - DampingFactor) + DampingFactor * this.pagerank[k];
}
// Display PageRank
System.out.printf("\n Final Page Rank : \n");
for (k = 1; k <= totalNodes; k++) {
System.out.printf(" Page Rank of " + k + " is :\t" + this.pagerank[k] + "\n");
System.out.printf(
" Page Rank of " + k + " is :\t" + this.pagerank[k] + "\n"
);
}
}
}
}