|
|
|
|
|
|
by lmm
3669 days ago
|
|
|
There are some graph algorithms that are probably most easily expressed with a mutable, garbage-collected graph, sure. This shouldn't be something that you have to implement yourself though; if you really need a garbage-collected graph datastructure, surely you just use a library that provides one. |
|
|