package/gonum
1
0
Fork 0
mirror of https://github.com/gonum/gonum.git synced 2025-10-21 22:29:30 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

graph/path/...: update for int64 IDs

Browse Source
This commit is contained in:
kortschak
2017-06-16 11:05:28 +09:30
committed by Dan Kortschak
parent 9d34456e6d
commit 15ecc07d40
20 changed files with 93 additions and 93 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
graph/path/disjoint.go
View File

@@ -18,7 +18,7 @@ package path
// two sets when an edge is created between two vertices, and refuses to make an edge between two
// vertices if they're part of the same set.
type disjointSet struct {
master map[int]*disjointSetNode
master map[int64]*disjointSetNode
}
type disjointSetNode struct {
@@ -27,11 +27,11 @@ type disjointSetNode struct {
}
func newDisjointSet() *disjointSet {
return &disjointSet{master: make(map[int]*disjointSetNode)}
return &disjointSet{master: make(map[int64]*disjointSetNode)}
}
// If the element isn't already somewhere in there, adds it to the master set and its own tiny set.
func (ds *disjointSet) makeSet(e int) {
func (ds *disjointSet) makeSet(e int64) {
if _, ok := ds.master[e]; ok {
return
}
@@ -41,7 +41,7 @@ func (ds *disjointSet) makeSet(e int) {
}
// Returns the set the element belongs to, or nil if none.
func (ds *disjointSet) find(e int) *disjointSetNode {
func (ds *disjointSet) find(e int64) *disjointSetNode {
dsNode, ok := ds.master[e]
if !ok {
return nil