-
Notifications
You must be signed in to change notification settings - Fork 0
This program identifies vertices in a directed graph that cannot have the median weight, based on the fact that more than half of the vertices with known weights have a weight greater or less than the median. The output of the program is the number of such vertices.
Otelu/Finding-Vertices-That-Cannot-Have-Median-Weight-in-a-Directed-Graph
About
This program identifies vertices in a directed graph that cannot have the median weight, based on the fact that more than half of the vertices with known weights have a weight greater or less than the median. The output of the program is the number of such vertices.
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published