reducers.js

Jump To … +

components.js contract.js cut.js graph.js index.js path.js reducers.js search.js show.js tree.js

reducers.js

import { addBinMap, addMap, append, asMap, flatTuple,
  get, mapDiff, removeMap, spread, spreadK, } from 'fenugreek-collections';

¶

resetNodeBin :: ( Map<edge>, node ) -> Map<edge> resets the nodes adjacency list to an empty map
```
export const resetNodeBin = (edges, src) => addMap(edges)(src)(asMap());
```
¶

addNodeBin :: ( Map<edge>, node ) -> Map<edge> adds a node:adjacency list pair to an edgelist
```
export const addNodeBin = (edges, src) => addMap(edges)(src)(asMap(get(edges)(src)));
```
¶

neighborPairs :: ( Map<edge>, node ) -> [ [node, node] ] returns an array of [node, neigbor] pairs from an edgelist
```
export const neighborPairs = edges => src =>
  spreadK(get(edges)(src)).map(append(src));
```

addEdgeBin :: ( Map<edge>, [node, node, Number] ) -> Map<edge> add a node:Map<{node: Number}> entry to an edgelist

export const addEdgeBin = (edges, [ src, nb, wt = 0 ]) => [
  [ src, addMap(get(edges)(src))(nb)(wt) ],
  [ nb, addMap(get(edges)(nb))(src)(wt) ],].reduce(addBinMap, asMap(edges));

removeEdgeBin :: ( Map<edge>, [node, node] ) -> Map<edge> removes a {node:Map<{node: Number}>} entry from an edgelist

export const removeEdgeBin = (edges, [ src, nb, ]) => [
  [ src, removeMap(get(edges)(src))(nb) ],
  [ nb, removeMap(get(edges)(nb))(src) ]].reduce(addBinMap, asMap(edges));

disconnectNodeBin :: ( Map<edge>, node ) -> Map<edge> removes all edges connected to a node

export const disconnectNodeBin = (edges, src) =>
  neighborPairs(edges)(src).reduce(removeEdgeBin, asMap(edges));

removeNodeBin :: ( Map<edge>, node ) -> Map<edge> isolates a node and removes it from edgelist

export const removeNodeBin = (edges, src) =>
  removeMap(disconnectNodeBin(edges, src))(src);

importEdgeBin :: ( Map<edge>, [node, [node: Number]] ) -> Map<edge> appends a node and all of its neighbors to an edgelist

export const importEdgeBin = (edges, [ src, nbs ]) =>
spread(mapDiff(nbs)(get(edges)(src))).map(flatTuple(src))
  .reduce(addEdgeBin, addNodeBin(edges, src));

mergeEdgesBin :: ( Map<edge>, Map<edge>, ) -> Map<edge> combines two Edge maps

export const mergeEdgesBin = (edges, alts) =>
 spread(asMap(alts)).reduce(importEdgeBin, edges);