npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2026 – Pkg Stats / Ryan Hefner

catalyst-graph

v1.0.23

Published

A tool for relating nodes by a predefined set of properties.

Readme

CatalystGraph

What is this?

A tool for relating nodes by a predefined set of properties.

What kind of graph?

This tool produces a graph tracking the weight of each node and of each pair of nodes (edge) to produce some output property:

Properties = [ 'happy', 'sad', 'bored' ]

Eating Node {                             Eating-Basketball Edge {                    Basketball Node {
  happyWeight: 0.5,         linked to       happyWeight: 0.85,          linked to       happyWeight: 0.75,
  sadWeight: 0.5,             <----         sadWeight: 0.25,              ---->         sadWeight: 0.25,
  boredWeight: 0.25,                        boredWeight: 0.25,                          boredWeight: 0.1,
}                                         }                                           }

How it works

  1. The user rates a set of activities (nodes) by providing the output (property) that the set produced, as well as an 'intensity rating' of the produced output: nodes = [ 'eating', basketball' ] produced output = 'happy' intensity rating = 8

  2. CatalystGraph updates each individual node's weight for producing the given output:

      Eating Node {                       Eating Node {
        happyWeight: *0.5*,    becomes      happyWeight: *0.6*,
        sadWeight: 0.5,         ---->       sadWeight: 0.5,
        boredWeight: 0.25,                  boredWeight: 0.25,
      }                                   }
      
      Basketball Node {                   Basketball Node {
        happyWeight: *0.75*,   becomes      happyWeight: *0.775*,
        sadWeight: 0.25,        ---->       sadWeight: 0.25,
        boredWeight: 0.1,                   boredWeight: 0.1,
      }                                   }
  1. CatalystGraph then updates each pair of nodes's (each edge) weight for producing the given output:
      Eating-Basketball Edge {            Eating-Basketball Edge {
        happyWeight: *0.85*,   becomes      happyWeight: *0.825*,
        sadWeight: 0.25,        ---->       sadWeight: 0.25,
        boredWeight: 0.25,                  boredWeight: 0.25,
      }                                   }
  1. CatalystGraph now has an up-to-date weight of each node (and of each edge) to produce some output. This graph can then be traversed to find relations between nodes

*Notice that the Eating-Basketball edge can have a 'happyRating' weight greater than the weight of either individual Eating or Basketball node. This is bcus the edge's 'happyRating' weight is only ever updated when the user rates the pair of Eating and Basketball together. *In short, individual Nodes and Edges can tell vastly different stories.