make-github-pseudonymous-again / js-gn

:globe_with_meridians: Graphs and networks data structures and algorithms for JavaScript

@aureooms/js-gn

Graphs and networks code bricks for JavaScript. Parents are @aureooms/js-algorithms and @aureooms/js-data-structures.

js-gn's Issues

Use graph theory notation

for ( let u of V(G) )
for ( let [ u , v , w ] of E( G ) )
for ( let [ v , w ] of E( G , u ) )
for ( let v of N( G , u ) )

Expander Decomposition

@aureooms/js-maximum-matching

Use generator instead of callback function for eitr and vitr

G.vitr( function ( u ) {
  G.eitr( u , function ( _ , v ) {
    ...
  } ) ;
} ) ;

becomes

for ( let u of V( G ) )
  for ( let [ v , _ ] of E( G , u ) )
    ...

Prim's algorithm

https://en.wikipedia.org/wiki/Prim's_algorithm

fuse using maps

use Map and WeakMap syntax

Bellman's algorithm

Cole & Vishkin

https://en.wikipedia.org/wiki/Graph_coloring#Parallel_and_distributed_algorithms

Topological sorting

https://en.wikipedia.org/wiki/Topological_sorting

fix dijkstra implementation

Kruskal's algorithm

https://en.wikipedia.org/wiki/Kruskal's_algorithm

Ford–Fulkerson algorithm

http://en.wikipedia.org/wiki/Ford–Fulkerson_algorithm

Bellman–Ford algorithm

https://en.wikipedia.org/wiki/Bellman–Ford_algorithm