Hello I am trying to solve graph theory related problem. It is related with k$-$truss algorithm. I use python networkx library and measure k$-$truss subgraphs. Based on k$-$truss subgraphs I assign edges trussness as their weight.

Then I am pruning some edges from graph and after pruning every edges I am trying to update the edges tussness. But I cannot accurately update the edges trussness after deleting an edge, specially for dense graphs.

Now I am following a paper $"$ Querying K$-$Truss Community in Large and Dynamic Graphs" and understand the section $4\mathrm{.}1$ Update Edge Trussness, from Algorithm $5.$ The algorithm update trussness for insert and edges by I want to update for delete an edge. I need some help to update edges trussness after deletion and write this code in python. Please help me$.$