philiprehberger-graph 0.4.0 → 0.5.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 73596f486ec100249fa2df0e4a9ef6aa1bdcd5e37e16b9b587dd6802f3fc9584
-  data.tar.gz: 0ddc969e510fb5543d9b981d53f73c15b53e73066defb0b7226998c79ef7ec15
+  metadata.gz: 178b5edb15123981edaaa93532c454677d40753f5ff3729fbe62026c0020f768
+  data.tar.gz: 3446356ba683b0077338dfa55dc052e36546c39d9606e67e0e37ad114368cdfd
 SHA512:
-  metadata.gz: 4cffa4c6398bfa251b9b8f82704d883d36e4c2dc7f1296369ff073364b8a71d0256a8f75b056d78372a38ca99809e8a09c560d549da4b8b8efa38ccf35130811
-  data.tar.gz: 80ca432cc5c0b1b35c979ccfebb1e7409d9170687a99ae9f4336e5159ce72a8d063cd5c8f7cc4829a4e22d9bad34c8d329e4fb8e8d3a3a668876994455ac628d
+  metadata.gz: f24fbd86ab0237395a61f5b012091817c4b152b24af2797e7264b2e853177fba4502a234863f1c56c83ecd9adb4bd11f5f0af4d804fae3afdf820a574ae09530
+  data.tar.gz: 16ecb22d98f3a29f2db9d12ae2f08d7ca4e5b03abd0af0c6a348dc2706a6bd4b0bec4e966a05bf662166c857bd6f73c06842c0cd3610caeafeba8454d9e1bf77

data/CHANGELOG.md

@@ -7,6 +7,11 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 ## [Unreleased]
 
+## [0.5.0] - 2026-04-29
+
+### Added
+- `Graph#total_weight` returning the sum of edge weights across all edges (cheap baseline for MST/flow comparisons)
+
 ## [0.4.0] - 2026-04-17
 
 ### Added

data/README.md

@@ -177,6 +177,16 @@ c.edge?(:a, :c)  # => true
 c.edge?(:a, :b)  # => false
 ```
 
+### Total Edge Weight
+
+```ruby
+g = Philiprehberger::Graph.new
+g.add_edge(:a, :b, weight: 3)
+g.add_edge(:b, :c, weight: 5)
+
+g.total_weight  # => 8
+```
+
 ### Query Methods
 
 ```ruby
@@ -269,6 +279,7 @@ g2 = Philiprehberger::Graph::Graph.from_json(g.to_json)
 | `#edges` | All edges as hashes |
 | `#node_count` | Number of nodes |
 | `#edge_count` | Number of edges |
+| `#total_weight` | Sum of edge weights across all edges |
 | `#empty?` | Whether the graph has no nodes |
 | `#each_node` | Iterate nodes (yields or returns Enumerator) |
 | `#each_edge` | Iterate edges (yields or returns Enumerator) |

data/lib/philiprehberger/graph/graph.rb

@@ -177,6 +177,17 @@ module Philiprehberger
         edges.length
       end
 
+      # Sum of weights across all edges. Returns 0 for an empty or edgeless graph.
+      #
+      # For undirected graphs each edge is counted once.
+      #
+      # @return [Numeric]
+      def total_weight
+        total = 0
+        each_edge { |edge| total += edge[:weight] }
+        total
+      end
+
       # Whether the graph has no nodes.
       #
       # @return [Boolean]

data/lib/philiprehberger/graph/version.rb

@@ -2,6 +2,6 @@
 
 module Philiprehberger
   module Graph
-    VERSION = '0.4.0'
+    VERSION = '0.5.0'
   end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: philiprehberger-graph
 version: !ruby/object:Gem::Version
-  version: 0.4.0
+  version: 0.5.0
 platform: ruby
 authors:
 - Philip Rehberger
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2026-04-17 00:00:00.000000000 Z
+date: 2026-04-29 00:00:00.000000000 Z
 dependencies: []
 description: Graph data structure supporting directed and undirected modes with adjacency
   list storage. Includes BFS, DFS, Dijkstra shortest path, topological sort, cycle