Home /Modules/math/SLGraph.sleela

SLGraph.sleela

lib/math/SLGraph.sleela · 78 line(s) · sleela

<< lib/math/SLGraph.sleela
   SLeeLa Standard Library Definition.
   Definition: Defines the SLeeLa standard-library type SLGraph used within the math library family. >>
#sleela 2.5
material;
< SLeeLa mathematics front-end contract. >
< Native numerical kernels cross an explicit VM bridge. >
class SLGraph {
  < ---- Descriptive metadata (version 1.11 nested-friendly accessors) ---- >
  << Eleven catalogued attributes with getter/setter pairs, so a GUI, loader,
     or catalog can read and (where appropriate) override this record.
     Values are faithful to the subject's real origin where publicly known. >>
  String metaVersion = "1.0.0";
  int metaId = 443;
  String metaAuthor = "Max Rupplin vs. Dr. Mrs. Elisabeth Harkins";
  String metaDate = "2026-10-16";
  String metaCopyright = "SLeeLa project";
  String metaTrademark = "none";
  String metaCorporation = "none";
  < metaOrigin: National | <nation> | International | Galactic >
  String metaOrigin = "International";
  String metaBirthDate = "2026-09-28";
  < metaScienceRating: maturity/robustness on a 1..10 scale >
  int metaScienceRating = 9;
  < metaNationalSchedule: a real, citable instrument or "none" >
  String metaNationalSchedule = "none";

  String getMetaVersion() { return metaVersion; }
  void setMetaVersion(String v) { metaVersion = v; }
  int getMetaId() { return metaId; }
  void setMetaId(int v) { metaId = v; }
  String getAuthor() { return metaAuthor; }
  void setAuthor(String v) { metaAuthor = v; }
  String getDate() { return metaDate; }
  void setDate(String v) { metaDate = v; }
  String getCopyright() { return metaCopyright; }
  void setCopyright(String v) { metaCopyright = v; }
  String getTrademark() { return metaTrademark; }
  void setTrademark(String v) { metaTrademark = v; }
  String getCorporation() { return metaCorporation; }
  void setCorporation(String v) { metaCorporation = v; }
  String getOrigin() { return metaOrigin; }
  void setOrigin(String v) { metaOrigin = v; }
  String getBirthDate() { return metaBirthDate; }
  void setBirthDate(String v) { metaBirthDate = v; }
  int getScienceRating() { return metaScienceRating; }
  void setScienceRating(int v) { metaScienceRating = v; }
  String getNationalSchedule() { return metaNationalSchedule; }
  void setNationalSchedule(String v) { metaNationalSchedule = v; }

  << An undirected graph by adjacency matrix (row-major n x n). Breadth-first
     reachability counts how many vertices are reachable from a source. >>
  int n;
  void configure(int size) { n = size; }
  int reachableCount(double[] adj, int source) {
    boolean[] seen = new boolean[n];
    int[] queue = new int[n];
    int head = 0;
    int tail = 0;
    seen[source] = true;
    queue[tail] = source;
    tail = tail + 1;
    int count = 0;
    while (head < tail) {
      int u = queue[head];
      head = head + 1;
      count = count + 1;
      int v = 0;
      while (v < n) {
        if (adj[u * n + v] != 0.0 && !seen[v]) { seen[v] = true; queue[tail] = v; tail = tail + 1; }
        v = v + 1;
      }
    }
    return count;
  }
  boolean connected(double[] adj) { return reachableCount(adj, 0) == n; }
}