From the course: Rust for Data Engineering
Unlock this course with a free trial
Join today to access over 24,900 courses taught by industry experts.
PageRank algorithm for sports data - Rust Tutorial
From the course: Rust for Data Engineering
PageRank algorithm for sports data
- [Instructor] All right, so today, I'm going to talk about PageRank algorithm and how you can do it in Rust, and the PageRank algorithm was first developed by Google to rank webpages based on their relevancy and importance, and I'm going to talk about how the concept of damping is also used in PageRank. You can see this right here, in this struct, I use damping and I also use iterations here. So first up, inside of here, look at the damping factor, and this is accounting for the fact that not all servers will continue clicking indefinitely. So the number of iterations is the number of times an algorithm will run to actually stabilize the rankings. And the other thing that we have as well is a new method here, and this new method will create a new instance of PageRank, and then if we look at the rank method itself, this is where the main algorithm is implemented. It takes a reference to a graph as an argument and it returns back…
Contents
-
-
-
-
Analyzing UFC fighter network using graph centrality in Rust4m 12s
-
(Locked)
Storing unique fruits using HashSet in Rust3m 18s
-
(Locked)
Maintaining sorted and unique fruits using BTreeSet in Rust2m 35s
-
(Locked)
Creating a fig-priority fruit salad using BinaryHeap in Rust2m 42s
-
(Locked)
PageRank algorithm for sports data4m 12s
-
(Locked)
Showing shortest path with Dijkstra3m 27s
-
(Locked)
Detecting strongly connected components: A deep dive into Kosaraju's algorithm4m 14s
-
(Locked)
Simple charting of data structures in Rust2m 26s
-
-
-
-
-
-
-
-
-
-