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

graphthis

v1.0.0

Published

Practical graph library

Downloads

11

Readme

graphthis

graphthis is practical library which stores information in graph format

Features

  • Nodes can be part of groups.
  • Nodes have name and value
  • Nodes have payload. The payload was created to carry the application context for that specific node. In conjuction with groups, it provides more flexibility. All nodes from a group, have a specific set of payload

Usage

var graphthis = require("./graphthis");

var graph = new graphthis.graph("Test Graph");
var nodeA = new graphthis.node("nodeA",5,null);
var nodeB = new graphthis.node("nodeB",5,null); 

graph.addNode(nodeA);
graph.addNode(nodeB);

//creating an edge
graph.createEdge(nodeA,nodeB, "labelME");

//add a set of nodes to a group
graph.addToGroup("Villains", [nodeA,nodeB]);
//or
graph.addGroupToNodes("group2", nodeA, nodeB, nodeC);

//getters for node and edge lists
graph.nodeList;
graph.edgeList;

//node list filtered by group
var nodeList = graph.getNodesByGroup("groupName");


//neighbors API
graph.neighbors(nodeB) // it will return an array with node neighbors

//graph.adjacent
graph.adjacent(nodeA,nodeB) // will return true/false if 2 nodes are adjacent

Caveat

Each edge contains an originator and an destination object. These objects are set on the appropiate nodes. So given an edge A --> B, node A will have an originatorEndpoint object and b will have an destinationEndpoint object. Each endpoint has a reference to the actual edge. I did this to be easy to calculate the node weight(outbound - inbound) and also distribute the information to nodes.

Future

  1. add all the basic operations for graphs
  2. add tests
  3. add support for multiple types of graphs ... much more