@graphty/graph-samples 0.0.1 → 0.1.2

package/src/datasets/knuth-miles/index.ts

@@ -0,0 +1,17 @@
+/**
+ * `@graphty/graph-samples/datasets/knuth-miles`: Knuth's miles.
+ */
+
+import { type SampleGraph } from "../../types.js";
+import { buildDataset } from "../build.js";
+import { DATA } from "./data.js";
+
+export { knuthMilesMeta } from "./meta.js";
+
+/**
+ * Knuth's miles: 128 North American cities and the 1949 road mileage between every pair.
+ * @returns a fresh copy of the graph as typed arrays
+ */
+export function knuthMiles(): SampleGraph {
+    return buildDataset(DATA);
+}

package/src/datasets/knuth-miles/meta.ts

@@ -0,0 +1,29 @@
+import { type DatasetMeta } from "../build.js";
+
+/** What the knuthMiles dataset is, where it came from and under which terms. */
+export const knuthMilesMeta: DatasetMeta = {
+    name: "knuth-miles",
+    title: "Knuth's North American city mileages",
+    description:
+        "128 cities of the United States and Canada with the 1949 highway mileage between every pair, as a complete weighted graph (8,128 edges). Node ids are the city names; each city carries its latitude, longitude and population as recorded in the Stanford GraphBase.",
+    citation: "D. E. Knuth, The Stanford GraphBase: A Platform for Combinatorial Computing, Addison-Wesley (1993).",
+    source: "https://mirrors.ctan.org/support/graphbase/miles.dat",
+    license:
+        'Derived from the Stanford GraphBase file miles.dat (copyright 1992 Stanford University; "may be freely copied but please do not change it in any way") -- this is a changed file, converted to a graph, and is not part of the Stanford GraphBase.',
+    nodes: 128,
+    edges: 8128,
+    directed: false,
+    weighted: true,
+    attributes: {
+        latitude: "f64: degrees north",
+        longitude: "f64: degrees east (negative: west)",
+        population: "u32: the population recorded in the Stanford GraphBase",
+    },
+    groundTruth: null,
+    showcases: [
+        "minimum spanning tree (Knuth's own demonstration)",
+        "travelling-salesman heuristics on real distances",
+        "thresholding a complete graph into a sparse road-like graph",
+        "geographic and distance-based (MDS, stress) layouts",
+    ],
+};

package/src/datasets/les-miserables/data.ts

@@ -0,0 +1,119 @@
+// THIS FILE IS AUTO GENERATED: DO NOT EDIT THIS FILE. INSTEAD EDIT graph-samples/scripts/convert-datasets.mjs
+// Source: https://raw.githubusercontent.com/networkx/networkx/networkx-3.1/networkx/generators/social.py
+// sha256: 82168365585cb949de6753d2ea690c111824f323c600e194f5f1c9832ee5016a
+
+import { type DatasetData } from "../build.js";
+
+export const DATA: DatasetData = {
+    directed: false,
+    nodeCount: 77,
+    ids: [
+        "Napoleon",
+        "Myriel",
+        "MlleBaptistine",
+        "MmeMagloire",
+        "CountessDeLo",
+        "Geborand",
+        "Champtercier",
+        "Cravatte",
+        "Count",
+        "OldMan",
+        "Valjean",
+        "Labarre",
+        "Marguerite",
+        "MmeDeR",
+        "Isabeau",
+        "Gervais",
+        "Listolier",
+        "Tholomyes",
+        "Fameuil",
+        "Blacheville",
+        "Favourite",
+        "Dahlia",
+        "Zephine",
+        "Fantine",
+        "MmeThenardier",
+        "Thenardier",
+        "Cosette",
+        "Javert",
+        "Fauchelevent",
+        "Bamatabois",
+        "Perpetue",
+        "Simplice",
+        "Scaufflaire",
+        "Woman1",
+        "Judge",
+        "Champmathieu",
+        "Brevet",
+        "Chenildieu",
+        "Cochepaille",
+        "Pontmercy",
+        "Boulatruelle",
+        "Eponine",
+        "Anzelma",
+        "Woman2",
+        "MotherInnocent",
+        "Gribier",
+        "MmeBurgon",
+        "Jondrette",
+        "Gavroche",
+        "Gillenormand",
+        "Magnon",
+        "MlleGillenormand",
+        "MmePontmercy",
+        "MlleVaubois",
+        "LtGillenormand",
+        "Marius",
+        "BaronessT",
+        "Mabeuf",
+        "Enjolras",
+        "Combeferre",
+        "Prouvaire",
+        "Feuilly",
+        "Courfeyrac",
+        "Bahorel",
+        "Bossuet",
+        "Joly",
+        "Grantaire",
+        "MotherPlutarch",
+        "Gueulemer",
+        "Babet",
+        "Claquesous",
+        "Montparnasse",
+        "Toussaint",
+        "Child1",
+        "Child2",
+        "Brujon",
+        "MmeHucheloup",
+    ],
+    edges: [
+        0, 1, 2, 1, 3, 1, 3, 2, 4, 1, 5, 1, 6, 1, 7, 1, 8, 1, 9, 1, 10, 11, 10, 3, 10, 2, 10, 1, 12, 10, 13, 10, 14, 10,
+        15, 10, 16, 17, 18, 17, 18, 16, 19, 17, 19, 16, 19, 18, 20, 17, 20, 16, 20, 18, 20, 19, 21, 17, 21, 16, 21, 18,
+        21, 19, 21, 20, 22, 17, 22, 16, 22, 18, 22, 19, 22, 20, 22, 21, 23, 17, 23, 16, 23, 18, 23, 19, 23, 20, 23, 21,
+        23, 22, 23, 12, 23, 10, 24, 23, 24, 10, 25, 24, 25, 23, 25, 10, 26, 24, 26, 10, 26, 17, 26, 25, 27, 10, 27, 23,
+        27, 25, 27, 24, 27, 26, 28, 10, 28, 27, 29, 23, 29, 27, 29, 10, 30, 23, 31, 30, 31, 10, 31, 23, 31, 27, 32, 10,
+        33, 10, 33, 27, 34, 10, 34, 29, 35, 10, 35, 34, 35, 29, 36, 34, 36, 35, 36, 10, 36, 29, 37, 34, 37, 35, 37, 36,
+        37, 10, 37, 29, 38, 34, 38, 35, 38, 36, 38, 37, 38, 10, 38, 29, 39, 25, 40, 25, 41, 24, 41, 25, 42, 41, 42, 25,
+        42, 24, 43, 10, 43, 26, 43, 27, 44, 28, 44, 10, 45, 28, 46, 47, 48, 46, 48, 25, 48, 27, 48, 10, 49, 26, 49, 10,
+        50, 49, 50, 24, 51, 49, 51, 26, 51, 10, 52, 51, 52, 39, 53, 51, 54, 51, 54, 49, 54, 26, 55, 51, 55, 49, 55, 39,
+        55, 54, 55, 26, 55, 10, 55, 17, 55, 25, 55, 41, 55, 48, 56, 49, 56, 55, 57, 55, 57, 41, 57, 48, 58, 55, 58, 48,
+        58, 27, 58, 57, 58, 10, 59, 58, 59, 55, 59, 48, 59, 57, 60, 48, 60, 58, 60, 59, 61, 48, 61, 58, 61, 60, 61, 59,
+        61, 57, 61, 55, 62, 55, 62, 58, 62, 59, 62, 48, 62, 57, 62, 41, 62, 61, 62, 60, 63, 59, 63, 48, 63, 62, 63, 57,
+        63, 58, 63, 61, 63, 60, 63, 55, 64, 55, 64, 62, 64, 48, 64, 63, 64, 58, 64, 61, 64, 60, 64, 59, 64, 57, 64, 10,
+        65, 63, 65, 64, 65, 48, 65, 62, 65, 58, 65, 61, 65, 60, 65, 59, 65, 57, 65, 55, 66, 64, 66, 58, 66, 59, 66, 62,
+        66, 65, 66, 48, 66, 63, 66, 61, 66, 60, 67, 57, 68, 25, 68, 10, 68, 24, 68, 27, 68, 48, 68, 41, 69, 25, 69, 68,
+        69, 10, 69, 24, 69, 27, 69, 48, 69, 41, 70, 25, 70, 69, 70, 68, 70, 10, 70, 24, 70, 27, 70, 41, 70, 58, 71, 27,
+        71, 69, 71, 68, 71, 70, 71, 10, 71, 48, 71, 41, 71, 25, 72, 26, 72, 27, 72, 10, 73, 48, 74, 48, 74, 73, 75, 69,
+        75, 68, 75, 25, 75, 48, 75, 41, 75, 70, 75, 71, 76, 64, 76, 65, 76, 66, 76, 63, 76, 62, 76, 48, 76, 58,
+    ],
+    weights: [
+        1, 8, 10, 6, 1, 1, 1, 1, 2, 1, 1, 3, 3, 5, 1, 1, 1, 1, 4, 4, 4, 4, 4, 4, 3, 3, 3, 4, 3, 3, 3, 3, 5, 3, 3, 3, 3,
+        4, 4, 3, 3, 3, 3, 4, 4, 4, 2, 9, 2, 7, 13, 1, 12, 4, 31, 1, 1, 17, 5, 5, 1, 1, 8, 1, 1, 1, 2, 1, 2, 3, 2, 1, 1,
+        2, 1, 3, 2, 3, 3, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 1, 1, 2, 3, 2, 2, 1, 3, 1, 1, 3, 1, 2, 1, 2,
+        1, 1, 1, 3, 2, 1, 1, 9, 2, 2, 1, 1, 1, 2, 1, 1, 6, 12, 1, 1, 21, 19, 1, 2, 5, 4, 1, 1, 1, 1, 1, 7, 7, 6, 1, 4,
+        15, 5, 6, 2, 1, 4, 2, 2, 6, 2, 5, 1, 1, 9, 17, 13, 7, 2, 1, 6, 3, 5, 5, 6, 2, 4, 3, 2, 1, 5, 12, 5, 4, 10, 6, 2,
+        9, 1, 1, 5, 7, 3, 5, 5, 5, 2, 5, 1, 2, 3, 3, 1, 2, 2, 1, 1, 1, 1, 3, 5, 1, 1, 1, 1, 1, 6, 6, 1, 1, 2, 1, 1, 4,
+        4, 4, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 2, 1, 1, 2, 2, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+    ],
+    columns: {},
+};

package/src/datasets/les-miserables/index.ts

@@ -0,0 +1,17 @@
+/**
+ * `@graphty/graph-samples/datasets/les-miserables`: Les Miserables co-appearances.
+ */
+
+import { type SampleGraph } from "../../types.js";
+import { buildDataset } from "../build.js";
+import { DATA } from "./data.js";
+
+export { lesMiserablesMeta } from "./meta.js";
+
+/**
+ * The Les Miserables co-appearance network: 77 characters (node ids are the names), 254 weighted co-appearances.
+ * @returns a fresh copy of the graph as typed arrays
+ */
+export function lesMiserables(): SampleGraph {
+    return buildDataset(DATA);
+}

package/src/datasets/les-miserables/meta.ts

@@ -0,0 +1,24 @@
+import { type DatasetMeta } from "../build.js";
+
+/** What the lesMiserables dataset is, where it came from and under which terms. */
+export const lesMiserablesMeta: DatasetMeta = {
+    name: "les-miserables",
+    title: "Les Miserables co-appearances",
+    description:
+        "Characters of Victor Hugo's novel Les Miserables, joined when they appear in the same chapter; the weight counts those chapters. As in the Stanford GraphBase jean.dat, via networkx.",
+    citation: "D. E. Knuth, The Stanford GraphBase: A Platform for Combinatorial Computing, Addison-Wesley (1993).",
+    source: "https://raw.githubusercontent.com/networkx/networkx/networkx-3.1/networkx/generators/social.py",
+    license:
+        "Derived from the Stanford GraphBase file jean.dat (copyright D. E. Knuth; may be freely copied and distributed, and a changed file must be renamed and identified as not part of the Stanford GraphBase -- this is such a changed file) through the networkx 3.1 copy (BSD-3-Clause).",
+    nodes: 77,
+    edges: 254,
+    directed: false,
+    weighted: true,
+    attributes: {},
+    groundTruth: null,
+    showcases: [
+        "weighted community detection",
+        "betweenness (Valjean, Myriel)",
+        "force-directed layouts with edge weights",
+    ],
+};