Improve GraphDistance statistics
Registered by
Mathieu Bastian
GraphDistance is a statistics class that computes distance results with Brandes algorithm. Some improvements can be made, including:
- memory use improvements
- average centrality over only reachable nodes
- betweeness to be normalized by 2 for undirected networks
Blueprint information
- Status:
- Complete
- Approver:
- pjmcswee
- Priority:
- Undefined
- Drafter:
- pjmcswee
- Direction:
- Needs approval
- Assignee:
- pjmcswee
- Definition:
- Approved
- Series goal:
- Accepted for 0.7
- Implementation:
- Implemented
- Milestone target:
- None
- Started by
- Mathieu Bastian
- Completed by
- Mathieu Bastian
Related branches
Related bugs
Sprints
Whiteboard
(?)