Add compiler front-end support infrastructure

.clang-format

@@ -15,6 +15,7 @@ NamespaceIndentation: None
 # Braces (Next-line indented: Custom style with IndentBraces: true)
 BreakBeforeBraces: Custom
 BraceWrapping:
+  AfterCaseLabel: true
   AfterClass: true
   AfterControlStatement: Always
   AfterEnum: true

.coderabbit.yaml

@@ -1,7 +1,7 @@
 # CodeRabbit Configuration for Aleph-w
 # https://docs.coderabbit.ai/guides/configure-coderabbit
 
-language: "en-US"
+language: "es-ES"
 
 reviews:
   # Enable reviews on ALL branches, not just default

.github/workflows/planarity_gephi_nightly.yml

@@ -336,7 +336,7 @@ jobs:
               f.write(f"asset_name={asset_name}\n")
           PY
 
-      - name: Validate fixture with real Gephi binary
+      - name: Validate fixture and downloaded Gephi executable
         shell: bash
         env:
           GEPHI_EXE: ${{ steps.install_gephi.outputs.gephi_exe }}
@@ -350,6 +350,7 @@ jobs:
           import json
           import os
           import pathlib
+          import shlex
           import subprocess
           import sys
 
@@ -372,8 +373,8 @@ jobs:
                       "id": "nightly.real-gephi.smoke",
                       "os": "any",
                       "gephi_version": gephi_version,
-                      "description": "Nightly real-Gephi smoke check using downloaded package.",
-                      "cmd": f"\"{gephi_exe}\" --version",
+                      "description": "Nightly downloaded Gephi executable availability probe.",
+                      "cmd": f'ruby -e "path = ARGV.fetch(0); exit((File.file?(path) and File.executable?(path)) ? 0 : 1)" {shlex.quote(gephi_exe)}',
                   }
               ],
           }

.gitignore

@@ -362,6 +362,10 @@ EDGE_AS_NODE_STATUS.md
 # AI agent config files
 AGENTS.md
 CLAUDE.md
+GPT.md
+DEEPSEEK.md
+QWEN.md
+KIWI.md
 #GEMINI.md
 
 # Temp scripts in root

Bellman_Ford.H

@@ -38,43 +38,29 @@
  *  directed graph. Unlike Dijkstra's algorithm, Bellman-Ford can handle
  *  graphs with negative edge weights and can detect negative-weight cycles.
  *
- *  ## Algorithms Provided
- *
- *  - **Standard Bellman-Ford**: O(V*E) time complexity
- *  - **SPFA (Shortest Path Faster Algorithm)**: Queue-based optimization
- *    that is often faster in practice on sparse graphs
- *
- *  ## Key Features
- *
- *  - Handles negative edge weights
- *  - Detects negative-weight cycles
- *  - Can return the negative cycle as a path
- *  - Supports both painted (in-place) and separate tree construction
- *
  *  ## Complexity
  *
- *  | Operation | Time | Space |
- *  |-----------|------|-------|
- *  | Standard | O(V*E) | O(V) |
- *  | SPFA (avg) | O(E) | O(V) |
- *  | SPFA (worst) | O(V*E) | O(V) |
- *
- *  ## Usage Example
+ *  | Algorithm | Time (avg) | Time (worst) | Space |
+ *  |-----------|------------|--------------|-------|
+ *  | Standard | O(V*E) | O(V*E) | O(V) |
+ *  | SPFA | O(E) | O(V*E) | O(V) |
  *
- *  ```cpp
+ *  @par Example
+ *  @code
  *  List_Digraph<Node, Arc> g;
  *  // ... build graph ...
+ *  List_Digraph<Node, Arc>::Node * start = g.get_first_node();
+ *
+ *  Bellman_Ford bf(g);
  *
- *  Bellman_Ford<List_Digraph<Node, Arc>> bf(g);
- *  
- *  // Check for negative cycles and compute shortest paths
- *  if (bf.has_negative_cycle(start_node)) {
+ *  // Check for negative cycles and compute shortest paths from 'start'
+ *  if (bf.has_negative_cycle(start)) {
  *    Path<Graph> cycle = bf.build_negative_cycle();
  *    // handle negative cycle
  *  } else {
- *    // Use the shortest path tree
+ *    // bf.is_painted() is true, Spanning_Tree bits are set
  *  }
- *  ```
+ *  @endcode
  *
  *  @see Dijkstra.H For graphs without negative weights (more efficient)
  *  @see Floyd_Warshall.H For all-pairs shortest paths

Blossom.H

@@ -40,15 +40,21 @@
  *  contracts them into single super-nodes to find augmenting paths that 
  *  would otherwise be hidden.
  *
- *  ## Problem solved
- *  Given an undirected graph@f$G=(V,E)@f$, find a matching@f$M@f$
- *  (a set of arcs with no shared endpoints) such that@f$|M|@f$is maximized.
+ *  ## Complexity
  *
- *  ## Highlights
- *  - Works on **general** (non-bipartite) undirected graphs.
- *  - Handles odd cycles through recursive blossom contraction and expansion.
- *  - Supports all Aleph-w graph representations through the generic interface.
- *  - Integrates with Aleph-w arc filters for selective matching.
+ *  | Algorithm | Time | Space |
+ *  |-----------|------|-------|
+ *  | Edmonds-Blossom | O(V^3) | O(V + E) |
+ *
+ *  @par Example
+ *  @code
+ *  List_Graph<Node, Arc> g;
+ *  // ... add nodes and arcs ...
+ *
+ *  DynDlist<List_Graph<Node, Arc>::Arc*> matching;
+ *  size_t size = compute_maximum_cardinality_general_matching(g, matching);
+ *  // matching now contains the arcs of an optimal matching
+ *  @endcode
  *
  *  @example blossom_example.cc
  *

Blossom_Weighted.H

@@ -75,6 +75,7 @@
  *
  *  @see Blossom.H For maximum-cardinality (unweighted) matching
  *  @ingroup Graphs
+ *  @author Leandro Rabindranath León
  */
 
 #ifndef BLOSSOM_WEIGHTED_H

Branch_And_Bound.H

@@ -44,8 +44,8 @@
  *  @author Leandro Rabindranath León
  */
 
-# ifndef BRANCH_AND_BOUND_H
-# define BRANCH_AND_BOUND_H
+#ifndef BRANCH_AND_BOUND_H
+#define BRANCH_AND_BOUND_H
 
 #include <concepts>
 #include <utility>
@@ -284,7 +284,6 @@ and requires(Domain &domain, typename Domain::State &state, const typename Domai
       { domain.undo(state, move) } -> std::same_as<void>;
     };
 
-
 /** @brief Reusable branch-and-bound engine over implicit state spaces.
  *
  *  @tparam Domain Problem adapter exposing `bound(state)`, `is_complete(state)`
@@ -486,8 +485,7 @@ public:
 
   /** @brief Branch and bound with visited-bound map and solution callback. */
   template <typename VisitedMap, typename OnSolution>
-    requires SearchStateKeyProvider<Domain>
-         and SearchSolutionVisitor<OnSolution, Solution>
+    requires SearchStateKeyProvider<Domain> and SearchSolutionVisitor<OnSolution, Solution>
   [[nodiscard]] Result search(State initial_state, VisitedMap &visited_map, OnSolution &on_solution)
   {
     using State_Key = typename Domain::State_Key;
@@ -717,8 +715,8 @@ private:
         return false;
       }
 
-    const Objective bound_value = domain_.bound(state);
-    if (not result.incumbent.can_improve(bound_value))
+    if (const Objective bound_value = domain_.bound(state);
+        not result.incumbent.can_improve(bound_value))
       {
         ++result.stats.pruned_by_bound;
         return false;
@@ -733,8 +731,15 @@ private:
 
     auto explore_move = [&](const Move &move) -> bool
     {
-      return apply_move_and_recurse(move, state, path, result, stop,
-        [&]() { return dfs(state, path, depth + 1, result, on_solution); });
+      return apply_move_and_recurse(move,
+                                    state,
+                                    path,
+                                    result,
+                                    stop,
+                                    [&]()
+      {
+        return dfs(state, path, depth + 1, result, on_solution);
+      });
     };
 
     if (ordering_active_for_depth_first())
@@ -764,8 +769,7 @@ private:
   }
 
   template <typename OnSolution, typename VisitedMap>
-    requires SearchSolutionVisitor<OnSolution, Solution>
-         and SearchStateKeyProvider<Domain>
+    requires SearchSolutionVisitor<OnSolution, Solution> and SearchStateKeyProvider<Domain>
   [[nodiscard]] bool dfs_visited(State &state,
                                  SearchPath<Move> &path,
                                  const size_t depth,
@@ -826,7 +830,8 @@ private:
         was_inserted = true;
       }
 
-    auto rollback_visited = [&]() {
+    auto rollback_visited = [&]()
+    {
       if (was_inserted)
         visited.remove(key);
       else if (auto *pair = visited.search(key); pair != nullptr)
@@ -844,8 +849,15 @@ private:
       {
         auto explore_move = [&](const Move &move) -> bool
         {
-          return apply_move_and_recurse(move, state, path, result, stop,
-            [&]() { return dfs_visited(state, path, depth + 1, result, on_solution, visited); });
+          return apply_move_and_recurse(move,
+                                        state,
+                                        path,
+                                        result,
+                                        stop,
+                                        [&]()
+          {
+            return dfs_visited(state, path, depth + 1, result, on_solution, visited);
+          });
         };
 
         if (ordering_active_for_depth_first())
@@ -1009,4 +1021,4 @@ template <BranchAndBoundDomain Domain,
 
 }  // end namespace Aleph
 
-# endif  // BRANCH_AND_BOUND_H
+#endif  // BRANCH_AND_BOUND_H