In Page Rank, every vertex on the graph has some rank, and at every iteration, the value at a node in the graph is given by some weighted combination of the ranks of the adjacent nodes. We think about this algorithm not in terms of for loops but rather from the perspective of a vertex. DSLs allow us to express algorithms in this way.
In Page Rank, every vertex on the graph has some rank, and at every iteration, the value at a node in the graph is given by some weighted combination of the ranks of the adjacent nodes. We think about this algorithm not in terms of for loops but rather from the perspective of a vertex. DSLs allow us to express algorithms in this way.