subject:Data structures and algorithms

02 03 10 21 The following invocations relate to samplegraph.txt, with a fixed number of iterations and the fixed error rate that determines how many iterations will run. Your code should compute for this graph the same rank values (intermediate and final). A sample of the output for the case of N > 10 is shown (output truncated to first 4 lines of it). 1/16 - spiegraph.tut OP 1.2500000 [11-0.2500000 PE 21-0200000 - 200000 Itari 0-200000 Pf 1)-0.2400000 PE 21-0.1437100 P 3)-0.1637500 Iter: 263-0.2500000 B 11-0.154875 21-0.167500 31-0.1437500 Iter PL-1732 11-0.567 PC 3-0.1437500 (3) 100 Iter. 1732504 11.1 PE 210.111134 21.11.12 Theri- 11-0121659 1 22-05113246 PL 31-.1111346 Iter EP 01-18 11-0.1318059 21-01011086 31-01011066 Iter PC 0-0:149645 [ 17-01234406 E 21-010110063)-6.1011065 10 PE 63-, 1000 116.1336000 PL 21-0.0009804 PL 21.00304 The 11 PL 1100245 11-0.1200059 21-0.0890304 PL 31-0.0080304 Iter 1201 - 1400020 11-01208280 L 21-0.000000 1.10304 Itar13 PI 01-6.162020 I 11-01208289 21-0.0088 PL 31-970858 ter 14 : 03-6142020 L 1)-9.1200030 PL 21-0.08 11-0.0070 Iter 15 P01-1986195 11-0.1200230 P 21-0.08 11-00068 Iter 1. legraph.at se 01-6.2500000 [11-02100000 PL 2)-0.2500000 P 3) -200000 Ieriit 01-0.50000 110.2500000 P 21-0.1437500 PE 11-6.1437500 Ieri 3 PI 0 - 200000 11-0596875 PL 31-1437400 PL 31-01007:00 Iter 13th-1732346 P11-0.150687 P 21-0.1437500 PC 3-0.1437500 It PE 0173334 PL 1)-0.157 P 21-0111:46 PE3-111194 IHRE 1-O PE 11-0.13.0 PL 21-0.1111216 PL 31 2011 ItarPC 0-0.1016825 [ 1)-0.1395 [ 23-0.1111246 P 3)-6.1111246 Iter PE 1 A 1 110.131889 P 21-01011006 PL 11-0101100 Iter 0-1006 E 11-41234406 DE 21-01013006 E 23-0, 101 1066 IPL 01-0.142424 11-01234406 P 21-01011006 PE31-101006 Iter 10: 0-0.1924 11-01234000 2)-0.000433-0.0030804 ter 110-140424 1)-0.12020 [ 21-0.000204 3-0.0050304 Ther 2.14.2020 11-01208250 PI 3-0.000 23.6.2004 ter 1 : 0)-0.540200011-0120259 P 21-0.0970058 11-0.0070058 % /perk 0 - verylargegraph.txt Iter PI 0] -0.0136364 P[ 1)-0.0194318 Pt 2)-0.0310227 other vertices onitted For the HITS algorithm, you need to print two values not one. Follow the convention of the Subject notes Base : A/N 03-0.3333333/0.3333333 A/H 1)-0.3333333/0.3333333 A/H[ 23-0.3333333/0.3333333 Iter : 1:1/H 03-0.0000000/0.8320603 A/Ht 11-0.4472136/0.6547002 A/Ht 23-0.8944272/0.0000000 or for large graphs Iter 37 A/H0] =0.0000000/0.0000002 A/H[ 1)-0.0000001/0.0000238 A/H[ 21-0.0000002/1.0000000 A/H 3)-0.0000159/0.0000000 Deliverables. Include source code of all implemented functions or classes in an archive per Handout 2 guidelines. Document bugs: ne ngrenart.no partial noints