The paper presents a new algorithm FPPR which updates PageRanks of a directed network after topological changes in the graphs. The algorithm is capable of regenerating scores on node and link addition/deletion. The changes in the expected value of random surfers are used for updating the scores of the newly added nodes as well as the impacted chain where the nodes/links are added or removed. The complexity of the algorithm for k new node addition is \(\mathcal {O}(k\times d^{(k)}_{avg})\) where \(d^{(k)}_{avg}\) is the average degree of k nodes added. On the other hand for node deletion, the complexity is \(\mathcal {O}(|V_s|+|E_s|)\) where \(V_s\) and \(E_s\) the set of nodes and edges updated using Selective Breath First Update. Extensive experiments have been performed on different synthetic and real-world networks. The experimental result shows that the rank generated by the proposed method is highly correlated with that of the recalculation on changes using the benchmark Power Iteration algorithm.