Update examples

Author: code-shoily

examples/city_distance_matrix.gleam

@@ -31,18 +31,17 @@ pub fn main() {
     )
   {
     Ok(matrix) -> {
-      // Matrix is Dict(NodeId, Dict(NodeId, Weight))
-      dict.each(matrix, fn(from, rows) {
-        dict.each(rows, fn(to, weight) {
-          io.println(
-            "From "
-            <> int.to_string(from)
-            <> " to "
-            <> int.to_string(to)
-            <> ": "
-            <> int.to_string(weight),
-          )
-        })
+      // Matrix is Dict(#(NodeId, NodeId), Weight)
+      dict.each(matrix, fn(key, weight) {
+        let #(from, to) = key
+        io.println(
+          "From "
+          <> int.to_string(from)
+          <> " to "
+          <> int.to_string(to)
+          <> ": "
+          <> int.to_string(weight),
+        )
       })
     }
     Error(_) -> io.println("Negative cycle detected!")

examples/graph_generation_showcase.gleam

@@ -88,7 +88,7 @@ pub fn main() {
   io.println("(Directed has edges in both directions)")
 }
 
-fn print_graph_stats(name: String, graph: model.Graph(Nil, Int)) -> Nil {
+fn print_graph_stats(_name: String, graph: model.Graph(Nil, Int)) -> Nil {
   let node_count = model.all_nodes(graph) |> list_length()
   let edge_count = count_edges(graph)
 

examples/job_assignment.gleam

@@ -1,6 +1,7 @@
 import gleam/int
 import gleam/io
 import gleam/list
+import gleam/option.{None, Some}
 import yog/bipartite
 import yog/model
 

examples/render_dot.gleam

@@ -4,6 +4,7 @@ import gleam/option.{None, Some}
 import yog/model
 import yog/pathfinding
 import yog/render
+import yog/transform
 
 pub fn main() {
   // Create a sample graph
@@ -20,7 +21,7 @@ pub fn main() {
   io.println("--- Basic DOT Output ---")
   let dot_basic =
     render.to_dot(
-      graph |> model.map_edges(int.to_string),
+      graph |> transform.map_edges(int.to_string),
       render.default_dot_options(),
     )
   io.println(dot_basic)
@@ -32,7 +33,7 @@ pub fn main() {
       let options =
         render.path_to_dot_options(path, render.default_dot_options())
       let dot_highlighted =
-        render.to_dot(graph |> model.map_edges(int.to_string), options)
+        render.to_dot(graph |> transform.map_edges(int.to_string), options)
       io.println(dot_highlighted)
     }
     None -> io.println("No path found")

examples/render_json.gleam

@@ -1,4 +1,3 @@
-import gleam/int
 import gleam/io
 import gleam/json
 import yog/model

examples/render_mermaid.gleam

@@ -4,6 +4,7 @@ import gleam/option.{None, Some}
 import yog/model
 import yog/pathfinding
 import yog/render
+import yog/transform
 
 pub fn main() {
   // Create a sample graph
@@ -20,7 +21,7 @@ pub fn main() {
   io.println("--- Basic Mermaid Output ---")
   let mermaid_basic =
     render.to_mermaid(
-      graph |> model.map_edges(int.to_string),
+      graph |> transform.map_edges(int.to_string),
       render.default_options(),
     )
   io.println("```mermaid")
@@ -31,17 +32,18 @@ pub fn main() {
   io.println("\n--- Mermaid with Custom Labels & Highlighting ---")
   case pathfinding.shortest_path(graph, 1, 3, 0, int.add, int.compare) {
     Some(path) -> {
-      let options =
+      let base_options =
         render.MermaidOptions(
           node_label: fn(id, data) {
             data <> " (ID: " <> int.to_string(id) <> ")"
           },
           edge_label: fn(weight) { weight <> " km" },
-          highlighted_nodes: Some(path.nodes),
-          highlighted_edges: Some(render.path_to_edges(path)),
+          highlighted_nodes: None,
+          highlighted_edges: None,
         )
+      let options = render.path_to_options(path, base_options)
       let mermaid_custom =
-        render.to_mermaid(graph |> model.map_edges(int.to_string), options)
+        render.to_mermaid(graph |> transform.map_edges(int.to_string), options)
       io.println("```mermaid")
       io.println(mermaid_custom)
       io.println("```")

examples/social_network_analysis.gleam

@@ -1,4 +1,5 @@
 import gleam/io
+import gleam/string
 import yog/components
 import yog/model.{Directed}
 
@@ -15,6 +16,6 @@ pub fn main() {
 
   // Find groups of mutually connected users
   let communities = components.strongly_connected_components(social_graph)
-  io.debug(communities)
+  io.println(string.inspect(communities))
   // => [[1, 2, 3]]  // All three users form a strongly connected community
 }

examples/task_ordering.gleam

@@ -1,5 +1,4 @@
 import gleam/dict
-import gleam/int
 import gleam/io
 import gleam/list
 import gleam/string
@@ -40,7 +39,9 @@ pub fn main() {
       |> model.add_edge(from: prereq_id, to: step_id, with: Nil)
     })
 
-  case topological_sort.lexicographical_topological_sort(graph, int.compare) {
+  case
+    topological_sort.lexicographical_topological_sort(graph, string.compare)
+  {
     Ok(order) -> {
       let task_order =
         order

src/examples

@@ -0,0 +1 @@
+/home/mafinar/repos/gleam/yog/examples