Dear friends, I need your help again
There is undirected weighted graph
I manually calculated the centrality (Brande's algorithm) for each node.
1 - 0
2 - 1.5
3 - 0
4 - 3
5 - 2
Then I calculated through the algorithm link and got slightly different values.
1 - 0
2 - 1.667
3 - 0
4 - 3.167
5 - 2.167
I implemented the algorithm on Rust, of course. I haven't uploaded it to GitHub yet.
Who is wrong?