@graphty/graphty-element 2.3.1 → 2.4.0

package/dist/graphty-catalog.json

@@ -1,7 +1,7 @@
 {
   "$generated": "THIS FILE IS AUTO GENERATED: DO NOT EDIT THIS FILE. INSTEAD EDIT the descriptor tables in graphty-element/src/catalog/ AND RUN graphty-element/scripts/generate-catalog-json.mjs (it runs as part of `npm run build`).",
   "package": "@graphty/graphty-element",
-  "version": "2.3.0",
+  "version": "2.3.1",
   "algorithms": [
     {
       "key": "degree",
@@ -2325,6 +2325,159 @@
           "key": "min-cut"
         }
       ]
+    },
+    {
+      "key": "k-core",
+      "plainName": "Core depth",
+      "technicalName": "K-core decomposition",
+      "description": "Peels the graph layer by layer and gives each node the depth of the most tightly knit core it belongs to: a node of depth k has at least k neighbours inside that core.",
+      "category": "structure",
+      "shape": "node-metric",
+      "fields": [
+        {
+          "name": "value",
+          "plainName": "Core depth",
+          "technicalName": "core number",
+          "kind": "node",
+          "type": "integer",
+          "path": "results.$.value"
+        },
+        {
+          "name": "rank",
+          "plainName": "Rank",
+          "technicalName": "rank",
+          "kind": "node",
+          "type": "integer",
+          "path": "results.$.rank"
+        },
+        {
+          "name": "percentile",
+          "plainName": "Percentile",
+          "technicalName": "percentile",
+          "kind": "node",
+          "type": "number",
+          "path": "results.$.percentile"
+        },
+        {
+          "name": "min",
+          "plainName": "Lowest",
+          "technicalName": "min",
+          "kind": "graph",
+          "type": "number",
+          "path": "results.$.min"
+        },
+        {
+          "name": "max",
+          "plainName": "Highest",
+          "technicalName": "max",
+          "kind": "graph",
+          "type": "number",
+          "path": "results.$.max"
+        },
+        {
+          "name": "median",
+          "plainName": "Middle",
+          "technicalName": "median",
+          "kind": "graph",
+          "type": "number",
+          "path": "results.$.median"
+        },
+        {
+          "name": "mean",
+          "plainName": "Average",
+          "technicalName": "mean",
+          "kind": "graph",
+          "type": "number",
+          "path": "results.$.mean"
+        },
+        {
+          "name": "measured",
+          "plainName": "Measured",
+          "technicalName": "measured",
+          "kind": "graph",
+          "type": "integer",
+          "path": "results.$.measured"
+        },
+        {
+          "name": "normalization",
+          "plainName": "Normalization",
+          "technicalName": "normalization",
+          "kind": "graph",
+          "type": "string",
+          "path": "results.$.normalization"
+        },
+        {
+          "name": "tiedAtMin",
+          "plainName": "Tied at the lowest value",
+          "technicalName": "tiedAtMin",
+          "kind": "graph",
+          "type": "integer",
+          "path": "results.$.tiedAtMin"
+        }
+      ],
+      "options": [],
+      "costClass": "instant",
+      "complexity": "O(n + m)",
+      "legacyKeys": [
+        {
+          "key": "k-core"
+        }
+      ]
+    },
+    {
+      "key": "link-prediction",
+      "plainName": "Likely new links",
+      "technicalName": "Link prediction",
+      "description": "Scores the pairs of nodes that are not yet joined by the neighbours they share, and lists the pairs most likely to be joined next.",
+      "category": "prediction",
+      "shape": "pair-list",
+      "fields": [
+        {
+          "name": "pairs",
+          "plainName": "Likely new links",
+          "technicalName": "pairs",
+          "kind": "graph",
+          "type": "table",
+          "path": "results.$.pairs"
+        }
+      ],
+      "options": [
+        {
+          "name": "method",
+          "plainName": "Method",
+          "technicalName": "method",
+          "type": "enum",
+          "description": "Common neighbours counts the neighbours two nodes share. Adamic-Adar counts them too, but a shared neighbour with few connections counts for more than one with many.",
+          "default": "adamic-adar",
+          "values": [
+            {
+              "value": "adamic-adar",
+              "label": "Adamic Adar"
+            },
+            {
+              "value": "common-neighbors",
+              "label": "Common Neighbors"
+            }
+          ]
+        },
+        {
+          "name": "topK",
+          "plainName": "Pairs",
+          "technicalName": "topK",
+          "type": "integer",
+          "description": "How many of the best-scoring pairs to keep.",
+          "default": 10,
+          "min": 1,
+          "max": 1000
+        }
+      ],
+      "costClass": "heavy",
+      "complexity": "O(n^2 * d)",
+      "legacyKeys": [
+        {
+          "key": "link-prediction"
+        }
+      ]
     }
   ],
   "layouts": [
@@ -2534,6 +2687,93 @@
       ],
       "honoursWeights": false
     },
+    {
+      "id": "radial",
+      "plainName": "Rings from a Node",
+      "technicalName": "Radial layout",
+      "description": "Puts one node at the centre and every other node on a ring by how many steps away it is, so the rings read outward as distance from that node.",
+      "family": "geometric",
+      "kind": "batch",
+      "maxDimensions": 2,
+      "sizeRating": "any",
+      "structuralInputs": [],
+      "engine": "radial",
+      "options": [
+        {
+          "name": "scalingFactor",
+          "plainName": "Scaling Factor",
+          "technicalName": "scalingFactor",
+          "type": "number",
+          "description": "Multiplier for node positions",
+          "default": 100,
+          "min": 1,
+          "max": 1000
+        },
+        {
+          "name": "root",
+          "plainName": "Root Node",
+          "technicalName": "root",
+          "type": "node-id",
+          "description": "The node at the centre; empty picks the node with the most edges",
+          "default": null
+        },
+        {
+          "name": "scale",
+          "plainName": "Scale",
+          "technicalName": "scale",
+          "type": "number",
+          "description": "Radius of the outermost ring",
+          "default": 1,
+          "min": 0,
+          "step": 0.1
+        }
+      ],
+      "honoursWeights": false
+    },
+    {
+      "id": "grid",
+      "plainName": "Grid",
+      "technicalName": "Grid layout",
+      "description": "Places nodes in evenly spaced rows and columns, in the order the nodes were loaded.",
+      "family": "geometric",
+      "kind": "batch",
+      "maxDimensions": 2,
+      "sizeRating": "any",
+      "structuralInputs": [],
+      "engine": "grid",
+      "options": [
+        {
+          "name": "scalingFactor",
+          "plainName": "Scaling Factor",
+          "technicalName": "scalingFactor",
+          "type": "number",
+          "description": "Multiplier for node positions",
+          "default": 100,
+          "min": 1,
+          "max": 1000
+        },
+        {
+          "name": "columns",
+          "plainName": "Columns",
+          "technicalName": "columns",
+          "type": "integer",
+          "description": "Number of columns; empty makes the grid as close to square as it can",
+          "default": null,
+          "min": 0
+        },
+        {
+          "name": "scale",
+          "plainName": "Scale",
+          "technicalName": "scale",
+          "type": "number",
+          "description": "Half the length of the grid's longer side",
+          "default": 1,
+          "min": 0,
+          "step": 0.1
+        }
+      ],
+      "honoursWeights": false
+    },
     {
       "id": "shell",
       "plainName": "Concentric Rings",
@@ -2783,7 +3023,7 @@
           "technicalName": "seed",
           "type": "seed",
           "description": "Seed for reproducible random positions",
-          "default": null,
+          "default": 1,
           "min": 0,
           "advanced": true
         }
@@ -3816,16 +4056,7 @@
     }
   ],
   "unserved": {
-    "layouts": [
-      {
-        "id": "radial",
-        "reason": "No engine arranges a graph in rings by distance from a chosen node. The spiral layout winds outward but orders nodes by position in the list, not by the graph, so it answers a different question and is published under its own name instead."
-      },
-      {
-        "id": "grid",
-        "reason": "No engine places nodes on a regular lattice."
-      }
-    ],
+    "layouts": [],
     "formats": [
       {
         "id": "sif",
@@ -3879,6 +4110,8 @@
     "E_PARSE_FAILED",
     "E_EDGE_ENDPOINTS_UNRESOLVED",
     "E_ID_MISSING",
+    "E_EMPTY_LOAD",
+    "E_SUPERSEDED",
     "E_TOO_LARGE",
     "E_OUT_OF_MEMORY",
     "E_CAP_EXCEEDED",