adjacency list code bricks for JavaScript
npm install @aureooms/js-adjacency-listAdjacency list code bricks for JavaScript.
Follows the specification in
js-graph-spec.
Parent is js-gn.
``js`
for ( let v of V( G ) ) ... ;











Can be managed through jspm,
duo,
component,
bower,
ender,
jam,
spm,
and npm.
terminal
jspm install github:aureooms/js-adjacency-list
or
jspm install npm:@aureooms/js-adjacency-list
`
$3
No install step needed for duo!$3
`terminal
component install aureooms/js-adjacency-list
`$3
`terminal
bower install @aureooms/js-adjacency-list
`$3
`terminal
ender add @aureooms/js-adjacency-list
`$3
`terminal
jam install @aureooms/js-adjacency-list
`$3
`terminal
spm install @aureooms/js-adjacency-list --save
`$3
`terminal
npm install @aureooms/js-adjacency-list --save
`Require
$3
`js
let adjacencylist = require( "github:aureooms/js-adjacency-list" ) ;
// or
import adjacencylist from '@aureooms/js-adjacency-list' ;
`
$3
`js
let adjacencylist = require( "aureooms/js-adjacency-list" ) ;
`$3
`js
let adjacencylist = require( "@aureooms/js-adjacency-list" ) ;
`$3
The script tag exposes the global variable adjacencylist.
`html
`
Alternatively, you can use any tool mentioned here.$3
`js
require( [ "@aureooms/js-adjacency-list" ] , function ( adjacencylist ) { ... } ) ;
`Use
`js
let dll = require( "@aureooms/js-dll" ) ;
let List = dll.DoublyLinkedList ;let MultiGraph = adjacencylist.MultiGraph( List ) ;
// use
adjacencylist.MultiDiGraph( List , Map ) for directed multigraphs ;
// (Map is the new es6 class, or any other polyfill implementation)let { V , E , N } = require( "@aureooms/js-graph-theory-notation" ) ;
let G = new Graph( ) ;
let u = G.vadd( ) ;
let v = G.vadd( ) ;
let e = G.eadd( u , v ) ;
for ( let w of V( G ) ) ... ;
for ( let e of E( G ) ) ... ;
for ( let w of N( G , u ) ) ... ;
G.edel( e ) ;
G.vdel( v ) ;
G.vdel( u ) ;
``