liy


  • Simple and fast implementation of topological sorting. No dependencies. A circular graph will throw an error with circular nodes info.

    published 1.0.0 9 years ago
  • Use dependency statements in files for topological dependency sorting. Dependency statement name can be Statement name can be customised.

    published 0.4.0 9 years ago
  • A simple and lean library to manage state: View -> Action -> State -> Event

    published 0.1.1 2 years ago