diff --git a/README.md b/README.md
index f5c0694..490233e 100644
--- a/README.md
+++ b/README.md
@@ -8,10 +8,6 @@ A Go implementation of Hochbaum's PseudoFlow algorithm as [implemented here in C
An example command-line program is cmd/pseudo/main.go.
-
Status
-
-Release 2.2. (Note: large data sets like "_data/BVZ-tsukuba0.max" are VERY MEMORY INTENSIVE and cannot be run on 8 GB machines; for that data set you will need over 128 GB of memory.)
-
Prior Versions
The original port of the C source code is in the subdirectory [v1.2][v1.2]. It is used in an example command-line program cmd/pseudo/main_v1.2.go. It is fine for command-line or utility programs, but it is not safe for concurrent use in a server.
diff --git a/pseudo.go b/pseudo.go
index 25c4312..a01df3b 100644
--- a/pseudo.go
+++ b/pseudo.go
@@ -250,7 +250,7 @@ type node struct {
func (s *Session) newNode(number uint) *node {
return &node{
number: number,
- outOfTree: make([]*arc, int(s.numArcs)),
+ // outOfTree: make([]*arc, int(s.numArcs)),
}
}