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 🙏

© 2024 – Pkg Stats / Ryan Hefner

graphology-components

v1.5.4

Published

Connected components for graphology.

Downloads

80,479

Readme

Graphology Components

Connected components for graphology.

Installation

npm install graphology-components

Usage

forEachConnectedComponent

Iterates over the connected components of the given graph using a callback.

import {forEachConnectedComponent} from 'graphology-components';

forEachConnectedComponent(graph, component => {
  console.log(component);
});

forEachConnectedComponentOrder

Specialized version of forEachConnectedComponent that iterates over the connected component orders, i.e. the number of nodes they contain.

It consumes less memory than a naive approach mapping the component lengths using forEachConnectedComponent.

import {forEachConnectedComponentOrder} from 'graphology-components';

forEachConnectedComponentOrder(graph, order => {
  console.log(order);
});

countConnectedComponents

Returns the number of connected components of the given graph.

import {countConnectedComponents} from 'graphology-components';

const count = countConnectedComponents(graph);

connectedComponents

Returns the list of connected components of the given graph.

import {connectedComponents} from 'graphology-components';

const components = connectedComponents(graph);

If your graph is mixed or directed, the result will be what are usually called weakly connected components.

largestConnectedComponent

Returns the largest connected component of the given graph.

import {largestConnectedComponent} from 'graphology-components';

const largest = largestConnectedComponent(graph);

largestConnectedComponentSubgraph

Returns a subgraph of the largest connected component of the given graph.

import {largestConnectedComponentSubgraph} from 'graphology-components';

const subgraph = largestConnectedComponentSubgraph(graph);

cropToLargestConnectedComponent

Mutates the given graph to remove nodes and edges that are not part of its largest connected component.

import {cropToLargestConnectedComponent} from 'graphology-components';

cropToLargestConnectedComponent(graph);

stronglyConnectedComponents

Returns the list of strongly connected components of the given graph. (mixed or directed)

import {stronglyConnectedComponents} from 'graphology-components';

const components = stronglyConnectedComponents(graph);