filifa
/
gv2adj
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

remove AbsorbingNodes method

This commit is contained in:
filifa 2025-05-06 22:30:04 -04:00
parent 35132702d6
commit 06048d8a2a
1 changed files with 0 additions and 22 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
cmd/internal/graph/graph.go
View File

@ -17,7 +17,6 @@ along with this program. If not, see <http://www.gnu.org/licenses/>.
package graph package graph
import ( import (
"gonum.org/v1/gonum/graph"
"gonum.org/v1/gonum/graph/multi" "gonum.org/v1/gonum/graph/multi"
"gonum.org/v1/gonum/graph/simple" "gonum.org/v1/gonum/graph/simple"
"gonum.org/v1/gonum/mat" "gonum.org/v1/gonum/mat"
@ -34,27 +33,6 @@ func NewDirectedGraph() *DirectedGraph {
return &DirectedGraph{WeightedDirectedGraph: multi.NewWeightedDirectedGraph()} return &DirectedGraph{WeightedDirectedGraph: multi.NewWeightedDirectedGraph()}
} }
// AbsorbingNodes returns all the nodes in the Markov chain identified as
// absorbing nodes.
func (g *DirectedGraph) AbsorbingNodes() []graph.Node {
absorbingNodes := make([]graph.Node, 0)
for nodes := g.Nodes(); nodes.Next(); {
u := nodes.Node()
successors := g.From(u.ID())
if successors.Len() != 1 {
continue
}
successors.Next()
v := successors.Node()
if u == v {
absorbingNodes = append(absorbingNodes, u)
}
}
return absorbingNodes
}
// AdjacencyMatrix returns the graph's adjacency matrix. // AdjacencyMatrix returns the graph's adjacency matrix.
func (g *DirectedGraph) AdjacencyMatrix() *mat.Dense { func (g *DirectedGraph) AdjacencyMatrix() *mat.Dense {
adj := simple.NewDirectedMatrix(g.Nodes().Len(), 0, 0, 0) adj := simple.NewDirectedMatrix(g.Nodes().Len(), 0, 0, 0)