Rename simplify_network shortest-paths result attributes (breaking)

For consistency with the cluster method and consolidate_graph():
  attr(result, "edges")       -> attr(result, "keep.edges")
  attr(result, "edge_counts") -> attr(result, "edge.counts")

Update docs, tests, and NEWS accordingly.

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>

Author: SebKrantz

NEWS.md

@@ -30,6 +30,13 @@
 
 - The simplified graph returned by `method = "cluster"` now carries a `keep.edges` attribute containing the integer indices of the edges retained from the original graph.
 
+## Result Attributes — Breaking Changes
+
+- **`simplify_network(method = "shortest-paths")`**: the two result attributes have been renamed for consistency with the cluster method and `consolidate_graph()`:
+  - `"edges"` → `"keep.edges"` (integer vector of retained edge indices)
+  - `"edge_counts"` → `"edge.counts"` (traversal counts for each retained edge)
+  Update any code that reads `attr(result, "edges")` or `attr(result, "edge_counts")`.
+
 ## Result Attributes
 
 - The grouping/edge-tracking attributes attached to results are now consistent and documented. `consolidate_graph()` attaches `keep.edges` and `group.id` together (aligned, same length) for `recursive = "none"` or `"partial"`; with the default `recursive = "full"` they are omitted (the mapping would span multiple passes), which is now stated in the documentation. `create_undirected_graph()` now also exposes `group.id` and `group.sizes` (previously only `group.starts`, and undocumented), and `consolidate_graph()` strips any stale grouping attributes carried in from upstream operations.

R/utils.R

@@ -1020,8 +1020,8 @@ compute_degrees <- function(from_vec, to_vec) {
 #'     \item For \code{method = "shortest-paths"}:
 #'       \itemize{
 #'         \item All columns from the input \code{graph_df} (for edges that were kept)
-#'         \item Attribute \code{"edges"}: integer vector of edge indices from the original graph
-#'         \item Attribute \code{"edge_counts"}: integer vector indicating how many times each edge was traversed
+#'         \item Attribute \code{"keep.edges"}: integer vector of edge indices from the original graph
+#'         \item Attribute \code{"edge.counts"}: integer vector indicating how many times each retained edge was traversed
 #'       }
 #'     \item For \code{method = "cluster"}:
 #'       \itemize{
@@ -1317,8 +1317,8 @@ simplify_network <- function(graph_df, nodes = NULL, method = c("shortest-paths"
     if(verbose) cat(sprintf("Retained %d/%d edges traversed by shortest paths (%.1f%%)\n",
                             length(edges), fnrow(graph_df),
                             100 * length(edges) / fnrow(graph_df)))
-    attr(result, "edges") <- edges
-    attr(result, "edge_counts") <- edges_traversed[edges]
+    attr(result, "keep.edges") <- edges
+    attr(result, "edge.counts") <- edges_traversed[edges]
 
   } else {
 

man/simplify_network.Rd

@@ -464,8 +464,8 @@ test_that("simplify_network shortest-paths has edges attribute", {
                              method = "shortest-paths",
                              cost.column = "cost", verbose = FALSE)
 
-  expect_true(!is.null(attr(result, "edges")))
-  expect_true(all(attr(result, "edges") <= nrow(graph)))
+  expect_true(!is.null(attr(result, "keep.edges")))
+  expect_true(all(attr(result, "keep.edges") <= nrow(graph)))
 })
 
 test_that("simplify_network shortest-paths has edge_counts attribute", {
@@ -479,7 +479,7 @@ test_that("simplify_network shortest-paths has edge_counts attribute", {
                              method = "shortest-paths",
                              cost.column = "cost", verbose = FALSE)
 
-  edge_counts <- attr(result, "edge_counts")
+  edge_counts <- attr(result, "edge.counts")
   expect_true(!is.null(edge_counts))
   expect_true(all(edge_counts > 0))
 })
@@ -540,8 +540,8 @@ test_that("simplify_network shortest-paths nthreads matches single-thread output
                                 nthreads = 2L, verbose = FALSE)
 
   expect_identical(res_multi, res_single)
-  expect_identical(attr(res_multi, "edges"), attr(res_single, "edges"))
-  expect_identical(attr(res_multi, "edge_counts"), attr(res_single, "edge_counts"))
+  expect_identical(attr(res_multi, "keep.edges"), attr(res_single, "keep.edges"))
+  expect_identical(attr(res_multi, "edge.counts"), attr(res_single, "edge.counts"))
 })
 
 test_that("consolidate_graph leaves pure cycles intact (no crash/hang, C == R)", {