Get and traverse graph of ECMAScript/TypeScript modules
The Babel Traverse module maintains the overall tree state, and is responsible for replacing, removing, and adding nodes
Traverse JSON Schema passing each schema object to callback
Traverse graph engine in a browser tab — Cypher + 32 GDS algorithms via WebAssembly. Runs in a dedicated Web Worker; no server required.
traverse and transform objects by visiting every node on a recursive walk
This package exports a method that will traverse a JSON-Schema, calling a mutation function for each sub schema found. It is useful for building tools to work with JSON Schemas.
TypeScript definitions for @babel/traverse
Traverse an object and convert all ISO strings into Dates.
AST utils for webassemblyjs
traverse and transform objects by visiting every node on a recursive walk
Create graphs from module dependencies.
The Babel Traverse module maintains the overall tree state, and is responsible for replacing, removing, and adding nodes
Visitor keys used to help traverse the TypeScript-ESTree AST
Lightweight Babel AST traversal
Graph library for traversing and processing any directional graphs.
Low-level module graph traversal for Bare
TypeScript definitions for traverse
TypeScript definitions for babel-traverse
TxtNode traverse library
Constants and utilities about visitor keys to traverse AST.
Traversal functions for graphology.
A simple asynchronous tool
ECMAScript JS AST traversal functions
Dereference (aka parse refs) from JSON Schemas
Gremlin graph traversal language DSL and client for Ruby. Suitable and tested with gremlin-server and AWS Neptune.
Honey Mushroom builds and traverses common abstract data structures in Ruby
A small class for traversing object graphs.
Graph data structure supporting directed and undirected modes with adjacency list storage. Includes BFS, DFS, Dijkstra shortest path, topological sort, cycle detection, connected components, minimum spanning tree, maximum flow, graph coloring, bipartiteness checking, strongly connected components, and DOT/JSON serialization.
map definition and graph traversal for Elanthia
A very specific and opinionated web framework to traverse a graph data structure
Models a railroad as a graph and offers some traversing methods.
Simple mixin for adding graph like functions (parents, children, traversal, etc) to any class. Effectively, you'll get DAG (directed acyclic graph) behaviour between your classes and therefore the ability to model parent, child and sibling behaviours with ease!
Tree and flattened array data structures for traversing an ActiveRecord model graph
The Graphical Fragment Assembly (GFA) is a proposed format which allow to describe the product of sequence assembly. This gem implements the proposed specifications for the GFA format described under https://github.com/pmelsted/GFA-spec/blob/master/GFA-spec.md as close as possible. The library allows to create an RGFA object from a file in the GFA format or from scratch, to enumerate the graph elements (segments, links, containments, paths and header lines), to traverse the graph (by traversing all links outgoing from or incoming to a segment), to search for elements (e.g. which links connect two segments) and to manipulate the graph (e.g. to eliminate a link or a segment or to duplicate a segment distributing the read counts evenly on the copies).
Kinship is a schema-inferred relationship graph for Ruby applications. It automatically discovers parent/child relationships between models by inspecting attributes (e.g. user_id, post_id) and builds a complete in-memory graph with zero configuration. Kinship enables deep relationship traversal, automatic join planning, and eliminates common N+1 query patterns without requiring has_many or belongs_to declarations. It is framework-agnostic and works with Rails, Jetski, and custom ORMs.
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.