divisor_networks 0.1.0

Discrete Graphs for Indiscrete Researchers - Networks with Grothendieck Topology.
Documentation
  • Coverage
  • 0%
    0 out of 91 items documented0 out of 49 items with examples
  • Size
  • Source code size: 48.49 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 4.71 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Links
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • dnhmphrs

DivisorNetworks

Overview

DivisorNetworks is a Rust package designed for graph modeling and simulations. This library aims to provide a robust framework for analyzing and understanding discrete graph networks such as Hopfield networks and chip-firing models. It's currently a work in progress.

Features

  • Modular design with a basis in category theory and Grothendieck topology.
  • Integration with sheaf theory for consistency and advanced analysis.
  • Flexible simulation framework for Hopfield networks and chip-firing systems.
  • Rust implementation - potential for future Python bindings.

Libraries

  • src/category - Defines category theoeretic structure and Grothendieck topology.
  • src/graph - Contains the graph structures and node implementations.
  • src/sheaf - Manages sheaf and presheaf data, along with sheaf conditions.
  • src/simulation - Simulation logic for Hopfield networks and chip-firing systems.

Links