mojom/mojom_tool/utils/wellfounded_graphs.go - Issue 2028843002: Mojom frontend: Update shortened url for latest version of graph-theory paper.

Keyboard Shortcuts

	File
u :	up to issue
j / k :	jump to file after / before current file
J / K :	jump to next file with a comment after / before current file
	Side-by-side diff
i :	toggle intra-line diffs
e :	expand all comments
c :	collapse all comments
s :	toggle showing all comments
n / p :	next / previous diff chunk or comment
N / P :	next / previous comment
<Up> / <Down> :	next / previous line

	Issue
u :	up to list of issues
j / k :	jump to patch after / before current patch
o / <Enter> :	open current patch in side-by-side view
i :	open current patch in unified diff view

	Issue List
j / k :	jump to issue after / before current issue
o / <Enter> :	open current issue

Unified Diff: mojom/mojom_tool/utils/wellfounded_graphs.go

Issue 2028843002: Mojom frontend: Update shortened url for latest version of graph-theory paper. (Closed) Base URL: https://github.com/domokit/mojo.git@master

Patch Set: Created 4 years, 7 months ago

Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.

Jump to:

View side-by-side diff with in-line comments

Download patch

Index: mojom/mojom_tool/utils/wellfounded_graphs.go

diff --git a/mojom/mojom_tool/utils/wellfounded_graphs.go b/mojom/mojom_tool/utils/wellfounded_graphs.go

index 1266a96c4d5ec85bb1c9f3ab5a41a453fe31320a..6e2c32f67a7abcf4b1475f3cc2d8fb7bd9197290 100644

--- a/mojom/mojom_tool/utils/wellfounded_graphs.go

+++ b/mojom/mojom_tool/utils/wellfounded_graphs.go

@@ -11,7 +11,7 @@ import (

// 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

« no previous file with comments | « no previous file | no next file » | no next file with comments »