forked from openshift/origin
-
Notifications
You must be signed in to change notification settings - Fork 0
/
dense_directed_matrix.go
136 lines (120 loc) · 3.12 KB
/
dense_directed_matrix.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
// Copyright ©2014 The gonum 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 concrete
import (
"github.com/gonum/graph"
"github.com/gonum/matrix/mat64"
)
// DirectedDenseGraph represents a graph such that all IDs are in a contiguous
// block from 0 to n-1.
type DirectedDenseGraph struct {
absent float64
mat *mat64.Dense
}
// NewDirectedDenseGraph creates a directed dense graph with n nodes.
// If passable is true all pairs of nodes will be connected by an edge
// with unit cost, otherwise every node will start unconnected with
// the cost specified by absent.
func NewDirectedDenseGraph(n int, passable bool, absent float64) *DirectedDenseGraph {
mat := make([]float64, n*n)
v := 1.
if !passable {
v = absent
}
for i := range mat {
mat[i] = v
}
return &DirectedDenseGraph{mat: mat64.NewDense(n, n, mat), absent: absent}
}
func (g *DirectedDenseGraph) Has(n graph.Node) bool {
id := n.ID()
r, _ := g.mat.Dims()
return 0 <= id && id < r
}
func (g *DirectedDenseGraph) Nodes() []graph.Node {
r, _ := g.mat.Dims()
nodes := make([]graph.Node, r)
for i := 0; i < r; i++ {
nodes[i] = Node(i)
}
return nodes
}
func (g *DirectedDenseGraph) Edges() []graph.Edge {
var edges []graph.Edge
r, _ := g.mat.Dims()
for i := 0; i < r; i++ {
for j := 0; j < r; j++ {
if i == j {
continue
}
if !isSame(g.mat.At(i, j), g.absent) {
edges = append(edges, Edge{Node(i), Node(j)})
}
}
}
return edges
}
func (g *DirectedDenseGraph) From(n graph.Node) []graph.Node {
var neighbors []graph.Node
id := n.ID()
_, c := g.mat.Dims()
for j := 0; j < c; j++ {
if j == id {
continue
}
if !isSame(g.mat.At(id, j), g.absent) {
neighbors = append(neighbors, Node(j))
}
}
return neighbors
}
func (g *DirectedDenseGraph) To(n graph.Node) []graph.Node {
var neighbors []graph.Node
id := n.ID()
r, _ := g.mat.Dims()
for i := 0; i < r; i++ {
if i == id {
continue
}
if !isSame(g.mat.At(i, id), g.absent) {
neighbors = append(neighbors, Node(i))
}
}
return neighbors
}
func (g *DirectedDenseGraph) HasEdge(x, y graph.Node) bool {
xid := x.ID()
yid := y.ID()
return xid != yid && (!isSame(g.mat.At(xid, yid), g.absent) || !isSame(g.mat.At(yid, xid), g.absent))
}
func (g *DirectedDenseGraph) Edge(u, v graph.Node) graph.Edge {
if g.HasEdge(u, v) {
return Edge{u, v}
}
return nil
}
func (g *DirectedDenseGraph) HasEdgeFromTo(u, v graph.Node) bool {
uid := u.ID()
vid := v.ID()
return uid != vid && !isSame(g.mat.At(uid, vid), g.absent)
}
func (g *DirectedDenseGraph) Weight(e graph.Edge) float64 {
return g.mat.At(e.From().ID(), e.To().ID())
}
func (g *DirectedDenseGraph) SetEdgeWeight(e graph.Edge, weight float64) {
fid := e.From().ID()
tid := e.To().ID()
if fid == tid {
panic("concrete: set edge cost of illegal edge")
}
g.mat.Set(fid, tid, weight)
}
func (g *DirectedDenseGraph) RemoveEdge(e graph.Edge) {
g.mat.Set(e.From().ID(), e.To().ID(), g.absent)
}
func (g *DirectedDenseGraph) Matrix() mat64.Matrix {
// Prevent alteration of dimensions of the returned matrix.
m := *g.mat
return &m
}