var createWhisper = require('ngraph.cw');
// Graph is intance of ngraph.graph
var whisper = createWhisper(graph);
// The algorithm is iterative. We should continue running it until change
// rate within clusters is large:
var requiredChangeRate = 0; // 0 is complete convergence
while (whisper.getChangeRate() > requiredChangeRate) {
  whisper.step();
}
// When change rate is 0 (or very close to 0) we are done.
// Now we can query "class" of each node:
graph.forEachNode(printClass);
function printClass(node) {
  console.log(nodeId + ' belongs to ' + whisper.getClass(node.id));
}

var createWhisper = require('ngraph.cw');
// Consider only neighbours with incoming edges:
var inDegreeWhisper = createWhisper(graph, 'in');
// Or outgoing edges:
var outDegreeWhisper = createWhisper(graph, 'out');

var createWhisper = require('ngraph.cw');
var whisper = createWhisper(graph);
// assume we've done several iterations:
while (whisper.getChangeRate() > 0) {
  whisper.step();
}
// clusters is a Set object
var clusters = whisper.createClusterMap();
clusters.forEach(visitCluster);
function visitCluster(clusterNodes, clusterClass) {
  // each cluster has class identifier:
  assert(typeof clusterClass !== undefined);
  // And list of nodes within cluster:
  assert(Array.isArray(clusterNodes));
}