Package Exports

@aureooms/js-adjacency-matrix

This package does not declare an exports field, so the exports above have been automatically detected and optimized by JSPM instead. If any package subpath is missing, it is recommended to post an issue to the original package (@aureooms/js-adjacency-matrix) to support the "exports" field. If that is not possible, create a JSPM override to customize the exports field for this package.

Readme

js-adjacency-matrix

Adjacency matrix code bricks for JavaScript. Follows the specification in js-graph-spec. Parent is js-gn.

for ( let v of V( G ) ) ... ;

Can be managed through jspm, duo, component, bower, ender, jam, spm, and npm.

Install

jspm

jspm install github:aureooms/js-adjacency-matrix
# or
jspm install npm:@aureooms/js-adjacency-matrix

duo

No install step needed for duo!

component

component install aureooms/js-adjacency-matrix

bower

bower install @aureooms/js-adjacency-matrix

ender

ender add @aureooms/js-adjacency-matrix

jam

jam install @aureooms/js-adjacency-matrix

spm

spm install @aureooms/js-adjacency-matrix --save

npm

npm install @aureooms/js-adjacency-matrix --save

Require

jspm

let adjacencymatrix = require( "github:aureooms/js-adjacency-matrix" ) ;
// or
import adjacencymatrix from '@aureooms/js-adjacency-matrix' ;

duo

let adjacencymatrix = require( "aureooms/js-adjacency-matrix" ) ;

component, ender, spm, npm

let adjacencymatrix = require( "@aureooms/js-adjacency-matrix" ) ;

bower

The script tag exposes the global variable adjacencymatrix.

<script src="bower_components/@aureooms/js-adjacency-matrix/js/dist/adjacency-matrix.min.js"></script>

Alternatively, you can use any tool mentioned here.

jam

require( [ "@aureooms/js-adjacency-matrix" ] , function ( adjacencymatrix ) { ... } ) ;

Use

let Graph = adjacencymatrix.Graph ;
// use `adjacencymatrix.DiGraph` for directed graphs

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 ) ;