Skip to content

larose/nx-topological-sort-benchmark

Repository files navigation

Examples:

$ python benchmark.py topological_sort inst_600000
Module <module 'topological_sort'>
Num vertices: 199496
Num arcs: 600000
Time: 15.645081996917725 s
Feasible solution? True


$ python benchmark.py topological_sort_recursive inst_600000
Module <module 'topological_sort_recursive'>
Num vertices: 199496
Num arcs: 600000
^C
Too long...


$ python benchmark.py proposed_topological_sort inst_600000
Module <module 'proposed_topological_sort'>
Num vertices: 199496
Num arcs: 600000
Time: 0.6334869861602783 s
Feasible solution? True


$ python benchmark.py proposed_topological_sort_recursive inst_600000
Module <module 'proposed_topological_sort_recursive'>
Num vertices: 199496
Num arcs: 600000
Time: 0.4905271530151367 s
Feasible solution? True

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages