James Bardin
|
8e4bd669e8
|
test Set.Copy, Graph.UpEdges, Graph.DownEdges
|
2020-06-11 09:53:09 -04:00 |
|
James Bardin
|
32ae3b5452
|
make dag.Set a simple map
This allows iteration directly over the set, removing the need to
allocate and copy a new slice for every iteration.
|
2020-02-19 14:46:35 -05:00 |
|
Mitchell Hashimoto
|
6e632ec2ba
|
dag: test for EdgesFrom, EdgesTo
|
2016-10-19 13:38:53 -07:00 |
|
Mitchell Hashimoto
|
5d5045fdd6
|
dag: add HasVertex, HasEdge
|
2016-01-14 13:52:01 -08:00 |
|
Mitchell Hashimoto
|
05794199af
|
dag: use hashcodes to as map key to edge sets
|
2015-10-27 11:58:34 -07:00 |
|
Mitchell Hashimoto
|
caef7769ae
|
dag: Replace with the same values is a no-op
|
2015-05-07 11:22:07 -07:00 |
|
Mitchell Hashimoto
|
af8d33ddb8
|
dag: Replace
|
2015-02-19 12:07:56 -08:00 |
|
Mitchell Hashimoto
|
9dfce9c93a
|
dag: Remove, RemoveEdge, DownEdges, UpEdges
|
2015-02-19 12:07:54 -08:00 |
|
Mitchell Hashimoto
|
2a910585a2
|
dag: new Graph API
|
2015-02-19 12:07:51 -08:00 |