Skip to content

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.

Notifications You must be signed in to change notification settings

Otelu/Finding-Vertices-That-Cannot-Have-Median-Weight-in-a-Directed-Graph

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 

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

No packages published

Languages