Utilities for Closure Library based projects.
Utilities for Closure Library based projects. Camptocamp fork with support for goog.module.
Utilities to help with endpoint resolution
The `util.is*` functions introduced in Node v0.12.
[](https://www.npmjs.com/package/@aws-sdk/util-locate-window) [](https://www.npmjs.com/packag
Node.js's util module for all engines
unist utility to visit nodes
A parser to Amazon Resource Names
unist utility to recursively walk over nodes, with ancestral information
unist utility to check if a node passes a test
unist utility to serialize a node, position, or point as a human readable location
Utility functions
mdast utility to get the plain text content of a node
mdast utility to serialize markdown
[](https://www.npmjs.com/package/@aws-sdk/util-user-agent-node) [](https://www.npmjs.com/
unist utility to get the position of a node
mdast utility to transform to hast
hast utility to check if a node is inter-element whitespace
mdast extension to parse and serialize GFM task list items
mdast utility to check if a node is phrasing content
Various helper utilities
[](https://www.npmjs.com/package/@aws-sdk/util-format-url) [](https://www.npmjs.com/package/@aws-sd
hast utility to create an element from a simple CSS selector
mdast extension to parse and serialize GFM strikethrough
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
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