Mojom frontend: Update shortened url for latest version of graph-theory paper.

mojom/mojom_tool/utils/wellfounded_graphs.go

 // Copyright 2016 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 package utils
 
 import (
         "bytes"
         "fmt"
 )
 
 // This file contains an implementation of an algorithm to check the well-foundedness
 // of two-sorted directed graphs. See the paper
-// "Well-Founded Two-Sorted Directed Graphs" (https://goo.gl/ipxFKu) for background
+// "Well-Founded Two-Sorted Directed Graphs" (https://goo.gl/YrLmfY) for background
 // and detailed definitions. Here we give only a high-level overview.
 //
 // A two-sorted graph is a directed graph that contains two sorts of nodes called circle nodes and
 // square nodes. A node in a two-sorted graph is *well-founded* iff it satisfies the
 // following recursive definition:
 // (i) Leaf nodes are well-founded
 // (ii) A circle node is well-founded iff all of its children are well-founded
 // (iii) A non-leaf square node is well-founded iff at least one of its children is well-founded.
 // (See the paper for a more logically correct definition.)
 //
@@ skipping 587 matching lines @@
         for _, element := range path {
                 if len(description.Path) > 0 || element.node == cycleStart {
                         description.Path = append(description.Path, element.edge)
                 }
         }
         if description.Path[len(description.Path)-1].Target != cycleStart {
                 panic(fmt.Sprintf("%s != %s", description.Path[len(description.Path)-1].Target.Name(), cycleStart.Name()))
         }
         return &description
 }