whole_func_string: function undoNormalize(g) {
      g.eachNode(function(u, a) {
        if (a.dummy) {
          if ('index' in a) {
            var edge = a.edge;
            if (!g.hasEdge(edge.id)) {
              g.addEdge(edge.id, edge.source, edge.target, edge.attrs);
            }
            var points = g.edge(edge.id).points;
            points[a.index] = { x: a.x, y: a.y, ul: a.ul, ur: a.ur, dl: a.dl, dr: a.dr };
          }
          g.delNode(u);
        }
      });
    }
func_code_string: function undoNormalize(g) {
      g.eachNode(function(u, a) {
        if (a.dummy) {
          if ('index' in a) {
            var edge = a.edge;
            if (!g.hasEdge(edge.id)) {
              g.addEdge(edge.id, edge.source, edge.target, edge.attrs);
            }
            var points = g.edge(edge.id).points;
            points[a.index] = { x: a.x, y: a.y, ul: a.ul, ur: a.ur, dl: a.dl, dr: a.dr };
          }
          g.delNode(u);
        }
      });
    }
func_documentation_string: /*
  Reconstructs the graph as it was before normalization. The positions of
  dummy nodes are used to build an array of points for the original 'long'
  edge. Dummy nodes and edges are removed.