Given a weighted graph with n nodes and m edges. for each node v we should calculate number of nodes u such that d(v,u)<=k .↵
n,m<=5e4 k<=100;↵
Please somebody help me.↵
UPD: I don't know if it's important or not but Wi<=100 for every edge.
n,m<=5e4 k<=100;↵
Please somebody help me.↵
UPD: I don't know if it's important or not but Wi<=100 for every edge.
