Description
Page$Rank
Description
Implement(the(Page(Rank(algorithm on(a(directed(graph.(Here(we(assume(alpha =(0.85,(and(use(
the(equation:
Where(d(means(alpha,(N(is(the(number(of(pages(and(L(number(of(outbound(links.(Initial(PR(value(
for(each(node(is(1/N.((
Note:(You(have(to(handle(sink/dangling(nodes.
You(may(use(any(programming(language(you(like,(but(C++,(Java(or(Python(is(strongly(
recommended.(Please(make(sure(your(program(uses(input(and(output format(below (sample(
files(are(provided).
Input$Format
In(the(first(line,(2(integers n and(m,(separated(by(space,(denote the(number(of(nodes(and(edges.
In(the(following(m lines,(each(line(has(2(integers(x,%y,(which(shows(an(edge(x%’>%y.(Node ids(
(unique) range(from(1(to n. Duplicate(edges may(occur(and(should(be(counted multiple times.
Output$Format
N lines,(line(i has(the(node(I’s(PR(value.
Georgia(Institute(of(Technology CSE6240(; Spring(2015 Homework(2
Sample$Input
4(6
2(1
2(3
3(1
4(1
4(2
4(3
Sample$Output (reassigning$L(1)$$to$n)
0.45137628438
0.171219074305
0.243987180838
0.133417460477
Sample$Output (reassigning$L(1)$$to$n)1)
0.390652012753
0.190170412489
0.270992837732
0.148184737026
Deliverable
The(deliverable(should(contain(three(files,(please(put(all(the(files in(to(a(directory(named(“HW2;
{YOUR(FIRST(NAME};{YOUR(LAST(NAME}”:(
1.(Code.(For(example,(PR.py,(PR.cpp
2.(Documentation(explaining(your(code/methods.
3.(README.txt(showing(how(to(run(your(code.
Please(archive(the(folder(and(name(it(as(“HW2;{YOUR(FIRST(NAME};{YOUR(LAST(NAME}.zip”.(
and(upload(it(to(T;square.
Georgia(Institute(of(Technology CSE6240(; Spring(2015 Homework(2
Scoring$metrics:
(1)(Your(code((50%)
(2)(The documentation explaining(your(code/methods((20%)(and(README((10%)(showing(how(
to(run(your(code.
(3) Results(of(the(test cases that will(be(used(to(evaluate(your(code. (20%)
