Skip to content

Commit 06a1ea3

Browse files
committed
Fix edge notation in doc
1 parent 657bb06 commit 06a1ea3

File tree

2 files changed

+2
-2
lines changed

2 files changed

+2
-2
lines changed

build/cartesian.go

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@ import "strconv"
66
// a graph whose vertices correspond to ordered pairs (v1, v2),
77
// where v1 and v2 are vertices in g1 and g2, respectively.
88
// The vertices (v1, v2) and (w1, w2) are connected by an edge if
9-
// v1 = w1 and (v2, w2) ∊ g2 or v2 = w2 and (v1, w1) ∊ g1.
9+
// v1 = w1 and {v2, w2} ∊ g2 or v2 = w2 and {v1, w1} ∊ g1.
1010
//
1111
// In the new graph, vertex (v1, v2) gets index n⋅v1 + v2, where n = g2.Order(),
1212
// and index i corresponds to the vertice (i/n, i%n).

build/tensor.go

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@ import "strconv"
66
// a graph whose vertices correspond to ordered pairs (v1, v2),
77
// where v1 and v2 are vertices in g1 and g2, respectively.
88
// The vertices (v1, v2) and (w1, w2) are connected by an edge whenever
9-
// both of the edges (v1, w1) and (v2, w2) exist in the original graphs.
9+
// both of the edges {v1, w1} and {v2, w2} exist in the original graphs.
1010
//
1111
// In the new graph, vertex (v1, v2) gets index n⋅v1 + v2, where n = g2.Order(),
1212
// and index i corresponds to the vertice (i/n, i%n).

0 commit comments

Comments
 (0)