package/gonum
1
0
Fork 0
mirror of https://github.com/gonum/gonum.git synced 2025-10-19 05:24:52 +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/control_flow.go
View File

@@ -13,10 +13,10 @@ import (
// prune for strict post-dominators, immediate dominators etc.
//
// A dominates B if and only if the only path through B travels through A.
func Dominators(start graph.Node, g graph.Graph) map[int]set.Nodes {
func Dominators(start graph.Node, g graph.Graph) map[int64]set.Nodes {
allNodes := make(set.Nodes)
nlist := g.Nodes()
dominators := make(map[int]set.Nodes, len(nlist))
dominators := make(map[int64]set.Nodes, len(nlist))
for _, node := range nlist {
allNodes.Add(node)
}
@@ -71,10 +71,10 @@ func Dominators(start graph.Node, g graph.Graph) map[int]set.Nodes {
// prune for strict post-dominators, immediate post-dominators etc.
//
// A post-dominates B if and only if all paths from B travel through A.
func PostDominators(end graph.Node, g graph.Graph) map[int]set.Nodes {
func PostDominators(end graph.Node, g graph.Graph) map[int64]set.Nodes {
allNodes := make(set.Nodes)
nlist := g.Nodes()
dominators := make(map[int]set.Nodes, len(nlist))
dominators := make(map[int64]set.Nodes, len(nlist))
for _, node := range nlist {
allNodes.Add(node)
}