JSPM

  • Created
  • Published
  • Downloads 1
  • Score
    100M100P100Q14948F
  • License MIT

Immutable Graph data structures for TypeScript

Package Exports

  • @rimbu/graph-edge-valued

This package does not declare an exports field, so the exports above have been automatically detected and optimized by JSPM instead. If any package subpath is missing, it is recommended to post an issue to the original package (@rimbu/graph-edge-valued) to support the "exports" field. If that is not possible, create a JSPM override to customize the exports field for this package.

Readme

@rimbu/graph-edge-valued

This package contains the implementations for the EdgeValuedGraph type. It was mainly split off to a seperate package from the @rimbu/graph package to descrease build time and memory usage.

This package exports the following types:

Name Description
EdgeValuedGraph<N, V> a generic undirected valued graph with nodes of type N, and edge values of type V
EdgeValuedGraphHashed<N, V> a valued undirected graph with hashed nodes of type N, and edge values of type V
EdgevaluedGraphSorted<N, V> a valued undirected graph with sorted nodes of type N, and edge values of type V

For complete documentation please visit the Rimbu Docs.

Or Try Me Out in CodeSandBox.

Installation

All types are exported through @rimbu/core. It is recommended to use this package.

To install separately:

yarn add @rimbu/graph

or

npm i @rimbu/graph

Rimbu uses advanced and recursive typing, potentially making the TypeScript compiler quite slow in some cases, or causing infinite recursion. It is recommended to set the following values in the tsconfig.json file of your project:

{
  "compilerOptions": {
    "skipLibCheck": true,
    "noStrictGenericChecks": true
  }
}

Usage

Author

Arvid Nicolaas

Contributing

Feel very welcome to contribute to further improve Rimbu. Please read our Contributing guide.

Contributors

Made with contributors-img.

License

Licensed under the MIT License, Copyright © 2020-present Arvid Nicolaas.

See LICENSE for more information.