Graph data structure.
Directed Graph
Undirected Graph
Which kind of Typed Array is this JavaScript value? Works cross-realm, without `instanceof`, and despite Symbol.toStringTag.
Returns an array of Typed Array names that are available in the current environment
Robustly get the byte offset of a Typed Array
Get the ArrayBuffer out of a TypedArray, robustly.
Is this value a JS Typed Array? This module works cross-realm/iframe, does not depend on `instanceof` or mutable properties, and despite ES6 Symbol.toStringTag.
Robustly get the byte length of a Typed Array
A simple list of possible Typed Array names.
Robustly get the length of a Typed Array
Redux-Saga effects with strong types.
Production-ready TypeScript data structures: Heap, Deque, Trie, Graph, Red-Black Tree, TreeMap, TreeSet, and more. Zero dependencies, type-safe, with getRank/getByRank/rangeByRank support.
JSON Schema TypeScript definitions with complete inline documentation.
<p> <a href="https://www.npmjs.com/package/@microsoft/teams.graph-endpoints" target="_blank"> <img src="https://img.shields.io/npm/v/@microsoft/teams.graph-endpoints/latest" /> </a> <a href="https://www.npmjs.com/package/@microsoft/tea
Simple dependency graph.
Provides a normalized graph for managing relationships between resources
Node Rest and Http Clients for use with TypeScript
Type checking for JavaScript functions
InversifyJs strong type definitions
Better typed `querySelector` and `querySelectorAll`.
typesafe assertion library for TypeScript 3.7+
Type safe dependency injection framework for TypeScript
Get the graph of dependents in a monorepo
Shared types for graph theory.
Pathfinding library for calculating all node pairs' shortest paths in an unweighted undirected graph.
A Rust library for shortest path finding algorithms, including Dijkstra's, A*, and Bellman-Ford. Supports both directed and undirected graphs, with customizable heuristics and edge weights. Ideal for game development, network routing, and graph analysis.
#[derive(Graph)] for graph-theory crate
Graph is a type of hash that outputs in graphviz's dot format. It comes with a command-line interface that is easily pluggable. It ships with plugins to graph dependencies and status of installed rubygems, rake tasks, homebrew ports, mac ports, and freebsd ports, coloring leaf nodes blue, outdated nodes red, and outdated leaf nodes purple (red+blue). OSX quick tip: % sudo gem install graph --development % sudo brew install graphviz % gem unpack graph % cd graph* % rake gallery % open gallery/*.png
Allows rails models to work as the edges and nodes of a directed acyclic graph (dag). The edges may be typed.
Gem version of SVG:::Graph. SVG:::Graph is a pure Ruby library for generating charts, which are a type of graph where the values of one axis are not scalar. SVG::Graph has a verry similar API to the Perl library SVG::TT::Graph, and the resulting charts also look the same. This isn't surprising, because SVG::Graph started as a loose port of SVG::TT::Graph, although the internal code no longer resembles the Perl original at all.
dwpg_graph gem
JSON parser that understands cross-references and casts to typed Ruby objects. Implements JSONQuery against JSON trees and Ruby object graphs.
THIS VERSION IS RUBY 1.9.x COMPATIBLE! Gem version of SVG:::Graph. SVG:::Graph is a pure Ruby library for generating charts, which are a type of graph where the values of one axis are not scalar. SVG::Graph has a very similar API to the Perl library SVG::TT::Graph, and the resulting charts also look the same. This isn't surprising, because SVG::Graph started as a loose port of SVG::TT::Graph, although the internal code no longer resembles the Perl original at all.
The gem provides a client for the AllegroGraph 4.x RDF graph database. Features like searching geo-spatial data, type mapping and transactions are supported.
Includes the following Abstract Data Types: StacksAndQueues, Graphs, Linked Lists, and Geometrics. Please see README for full documentation. Or, once installed, "Zadt::ADT::help" contains a list of data types and functionality. And don't forget to require 'zadt' at the top!
Extract method signatures, call graphs, and type information from Sorbet-typed Ruby projects
Resty is designed as a client for a particular type of discoverable REST API; one that returns JSON, and where that JSON has particular keys which enable navigation of the data graph.
GRATR is a framework for graph data structures and algorithms. This library is a fork of RGL. This version utilizes Ruby blocks and duck typing to greatly simplfy the code. It also supports export to DOT format for display as graphics. GRATR currently contains a core set of algorithm patterns: * Breadth First Search * Depth First Search * A* Search * Floyd-Warshall * Best First Search * Djikstra's Algorithm * Lexicographic Search The algorithm patterns by themselves do not compute any meaningful quantities over graphs, they are merely building blocks for constructing graph algorithms. The graph algorithms in GRATR currently include: * Topological Sort * Strongly Connected Components * Transitive Closure * Rural Chinese Postman * Biconnected
Kumi is a declarative rules-and-calculation DSL for Ruby that compiles your business logic into a typed, analyzable dependency graph with vector semantics over ragged data. It does static checks at definition time, lowers to a small IR, and compiles to zero-runtime modules
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.