Skip to main content

A NetworkX package solving k-FIXED COP NUMBER

Project description

A NetworkX graph theory package that calculates whether the cop number of a graph is larger than a fixed k.

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

cop_number-1.0.2.zip (3.8 kB view details)

Uploaded Source

File details

Details for the file cop_number-1.0.2.zip.

File metadata

  • Download URL: cop_number-1.0.2.zip
  • Upload date:
  • Size: 3.8 kB
  • Tags: Source
  • Uploaded using Trusted Publishing? No

File hashes

Hashes for cop_number-1.0.2.zip
Algorithm Hash digest
SHA256 6b6a4ca7aeac6cfe422b1edf9cc8a1633ec7bb177a23a35f228fff024ba331b4
MD5 db738a4c8f9b4f2c8741b9ad572f9cfd
BLAKE2b-256 117871682c308b0f12da76987c894f142ae5a9b6047d592eca5bcf3df1131926

See more details on using hashes here.

Supported by

AWS Cloud computing and Security Sponsor Datadog Monitoring Depot Continuous Integration Fastly CDN Google Download Analytics Pingdom Monitoring Sentry Error logging StatusPage Status page