Project: networkx
| Language | python |
| OSS-Fuzz project | link |
| Project repository | link |
| Build status: Fuzzers | succeeding: Build log |
| Build status: Code coverage | succeeding: Build log |
| Build status: Fuzz Introspector | succeeding: Build log |
| Fuzzer count | 3 |
| Lines of code | 31700 |
| Lines covered | 6020 |
| Code coverage | 18.99% |
| Code coverage report | Report link |
| Static reachability | 0.00% |
| Fuzz Introspector report | Report link (from 2025-11-16) |
Historical Progression
Functions of interest to fuzz
This section outlines functions that may be of interest to fuzz. They are based on ranking functions that have a lot of complexity but currently exhibit low code coverage. The complexity is calculated based on the function itself as well as the functions called by the given function, i.e. the tree of code that the function triggers.
This is only a minor amount of introspection information available for this project. Please consult the Fuzz Introspector report for more information, e.g. the introspection table of all functions in the target project available here.
| Function name | Function source file | Accumulated cyclomatic complexity | Code coverage |
| networkx.algorithms.approximation.traveling_salesman.traveling_salesman_problem | networkx.algorithms.approximation.traveling_salesman | 532 | 5.714% |
| networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation | networkx.algorithms.connectivity.edge_augmentation | 476 | 0.0% |
| networkx.algorithms.approximation.traveling_salesman.asadpour_atsp | networkx.algorithms.approximation.traveling_salesman | 474 | 0.0% |
| networkx.algorithms.tree.branchings.maximum_spanning_arborescence | networkx.algorithms.tree.branchings | 429 | 0.0% |
| networkx.linalg.algebraicconnectivity.fiedler_vector | networkx.linalg.algebraicconnectivity | 397 | 7.142% |
| networkx.linalg.algebraicconnectivity.algebraic_connectivity | networkx.linalg.algebraicconnectivity | 397 | 14.28% |
| networkx.algorithms.cycles.chordless_cycles | networkx.algorithms.cycles | 394 | 0.0% |
| networkx.linalg.algebraicconnectivity.spectral_ordering | networkx.linalg.algebraicconnectivity | 394 | 0.0% |
| networkx.generators.lattice.hypercube_graph | networkx.generators.lattice | 386 | 0.0% |
| networkx.algorithms.tree.branchings.minimal_branching | networkx.algorithms.tree.branchings | 384 | 0.0% |