Page Rank Algorithm Project

COP 3530 Project: Simple Page Rank Algorithm program

Project Overview

$\text{C}++$ implementation of the PageRank algorithm, designed to model and rank the influence of nodes (web pages) within a directed graph structure. It utilizes an Adjacency List and custom data structures to efficiently perform iterative rank calculation, demonstrating a fundamental understanding of graph theory and distributed systems concepts.

Features

• Core Algorithm: Fully implemented Google's PageRank algorithm, including the iterative calculation process.
• Custom Graph Structure: Uses a custom $\text{Adjacency List}$ built with $\text{unordered_maps}$ for efficient $\text{O}(1)$ node lookup and edge manipulation.
• Dynamic Vertex Tracking: $\text{A custom Vertex class}$ tracks key metrics like in-degree, out-degree, and the calculated PageRank value.
• Input Parsing: Reads graph structure from standard input, parsing edges to dynamically build the network.
• Precision Output: Ranks are formatted and outputted with two decimal places of precision using $\text{C}++$ I/O streams.
• Rigorous Test Cases: Catch Test program with various test methods to individually assess the various elements of the algorithm

Author:

Jorge Ramirez - https://www.linkedin.com/in/jorge-ramirez-150b7935a/