JSPM

Found 29 results for acyclic

toposort

Topological sort of directed ascyclic graphs (like dependecy lists)

  • v2.0.2
  • 119.65
  • Published

toposort-class

Topological sort of directed acyclic graphs (like dependecy lists)

  • v1.0.1
  • 106.51
  • Published

toposource

Directed graphs analyzer for parallel traversals

  • v1.2.0
  • 72.58
  • Published

dag

Directed acyclic graph

  • v0.0.1
  • 49.79
  • Published

topology-runner

Run a topology consisting of a directed acyclic graph

  • v0.9.0
  • 41.77
  • Published

nats-topology-runner

Run a topology created with topology-runner using nats-jobs

  • v0.7.1
  • 40.44
  • Published

fast-toposort

A simple and efficient topological sorting algorithm for directed graphs.

  • v0.1.1
  • 39.79
  • Published

react-d3-dag

React component to create interactive D3 directed acyclic graphs (DAGs)

  • v0.2.0
  • 39.28
  • Published

incremental-cycle-detect

Keeps a directed acyclic graph topologically sorted each time you add an edge or vertex to check for cycles.

  • v0.4.0
  • 38.21
  • Published

quick-cyc

A component library for pipelines and acyclic flows in React

  • v1.1.0
  • 28.27
  • Published

dagjs

Simiple DAG (Directed Acyclic Graph) module with edge tagging

  • v0.1.4
  • 26.40
  • Published

@qiwi/toposort

Topological sort of directed ascyclic graphs (like dependecy lists)

  • v1.0.1
  • 21.90
  • Published

ipld-explorer-cli

Explore the IPLD directed acyclic graph with your keyboard

  • v0.14.2
  • 18.28
  • Published

@000alen/toposort

Topological sort of directed acyclic graphs (like dependency lists)

  • v2.0.4
  • 17.37
  • Published

zuvor

simple and reasonably fast implementation of directed acyclic graphs and sets with focus on finding the fastest execution order of interdependent tasks

  • v0.1.0
  • 17.37
  • Published

dag-progress

Calculate user progress for each vertex in an acyclic digraph

  • v2.0.1
  • 17.12
  • Published

dag-builder-js

dag-builder-js is a simple-to-use Javascript DAG library with support to N:N vertices/edges. It supports validating that no cycle can be created in real-time, import/export states and it's built on SVG so you can render graphs pretty much anywhere.

  • v1.0.0
  • 15.92
  • Published

dep-resolver

Asynchronous Dependency Resolver

  • v0.5.5
  • 11.03
  • Published

@gsvlabs/graph-search

Simple library to search and traverse graphs using DFS, BFS algorithms, and also detect cycles in directed graph input

  • v1.0.1
  • 10.36
  • Published

@graphtools/dag

DAG stands for “Directed Acyclic Graph”. DAGs represent a series of activities that happen in a specific order and do not self-reference (loop).

  • v1.0.3
  • 9.36
  • Published

obj-toposort

sort objects with dependencies

  • v2.0.0
  • 7.90
  • Published

hypercore-dag

DAGs on top of hypercore, allowing verified random-access to graph nodes

  • v0.0.0
  • 6.64
  • Published

iotapay

Pay using IOTA

    • v1.2.2
    • 6.19
    • Published

    dag-layout

    Graph Layout Helper

    • v1.1.0
    • 0.00
    • Published