@@ -45,38 +45,5 @@ class Graph {
4545 return weight;
4646 }
4747
48- /// Swaps the positions of [vertex1] and [vertex2] , updating the weight table.
49- void swap (int vertex1, int vertex2) {
50- if (vertex1 == vertex2) return ;
51- // Swap rows.
52- for (var i = 0 ; i < vertexCount; i++ ) {
53- var weightTo1 = weight (i, vertex1);
54- var weightTo2 = weight (i, vertex2);
55- setWeight (i, vertex1, weightTo2);
56- setWeight (i, vertex2, weightTo1);
57- }
58- // Swap columns.
59- for (var i = 0 ; i < vertexCount; i++ ) {
60- var weightFrom1 = weight (vertex1, i);
61- var weightFrom2 = weight (vertex2, i);
62- setWeight (vertex1, i, weightFrom2);
63- setWeight (vertex2, i, weightFrom1);
64- }
65- assert (weight (vertex1, vertex1) == 0 );
66- assert (weight (vertex2, vertex2) == 0 );
67- }
68-
69- /// Creates a new graph without the last vertex (or last [count] vertices).
70- Graph removeLastVertex ([int count = 1 ]) {
71- RangeError .checkValueInInterval (count, 1 , vertexCount, "count" );
72- var newCount = vertexCount - count;
73- var result = Graph (newCount);
74- for (var i = 0 ; i < newCount; i++ ) {
75- result._table
76- .setRange (i * newCount, (i + 1 ) * newCount, _table, i * vertexCount);
77- }
78- return result;
79- }
80-
8148 int get maxWeight => _table.reduce ((a, b) => a >= b ? a : b);
8249}
0 commit comments