@graphty/layout 1.6.1 → 1.6.2

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@graphty/layout",
-  "version": "1.6.1",
+  "version": "1.6.2",
   "description": "graph layout algorithms based on networkx",
   "author": "Adam Powers <apowers@ato.ms>",
   "main": "dist/layout.js",
@@ -77,6 +77,8 @@
     "coverage": "vitest run --coverage",
     "coverage:preview": "npx serve coverage -p 9052",
     "lint": "eslint && tsc --noEmit",
+    "lint:fix": "eslint --fix",
+    "lint:knip": "cd .. && pnpm run lint:knip -- --workspace layout",
     "typecheck": "tsc --noEmit",
     "build": "tsc",
     "build:bundle": "node scripts/build-bundle.js",

package/src/algorithms/optimization/index.ts

@@ -2,7 +2,5 @@
  * Re-export all optimization algorithms
  */
 
-export { _computeShortestPathDistances, _kamadaKawaiCostfn,_kamadaKawaiSolve } from "./kamada-kawai-solver";
-export { _lbfgsDirection } from "./lbfgs";
-export { _backtrackingLineSearch } from "./line-search";
+export { _computeShortestPathDistances, _kamadaKawaiSolve } from "./kamada-kawai-solver";
 export type { DistanceMap } from "./types";

package/src/algorithms/optimization/kamada-kawai-solver.ts

@@ -148,7 +148,7 @@ export function _kamadaKawaiSolve(distMatrix: number[][], positions: number[][],
  * @param dim - Dimension of layout
  * @returns Array with [cost, gradient]
  */
-export function _kamadaKawaiCostfn(
+function _kamadaKawaiCostfn(
     posVec: number[],
     invDist: number[][],
     meanWeight: number,

package/src/algorithms/planarity/embedding.ts

@@ -94,7 +94,7 @@ export function createTriangulationEmbedding(nodes: Node[], edges: Edge[], seed:
  * @param adjMap - Adjacency map
  * @returns Cycle as array of nodes, or null if none found
  */
-export function findCycle(nodes: Node[], _edges: Edge[], adjMap: Record<Node, Set<Node>>): Node[] | null {
+function findCycle(nodes: Node[], _edges: Edge[], adjMap: Record<Node, Set<Node>>): Node[] | null {
     if (nodes.length === 0) {return null;}
     if (nodes.length <= 2) {return nodes;} // Not a real cycle but handle it
 

package/src/algorithms/planarity/index.ts

@@ -3,6 +3,4 @@
  */
 
 export { checkPlanarity } from "./check";
-export { combinatorialEmbeddingToPos,createTriangulationEmbedding, findCycle } from "./embedding";
-export { lrPlanarityTest } from "./lr-test";
-export { isK5, isK33, tryFindBipartitePartition } from "./special-graphs";
+export { combinatorialEmbeddingToPos } from "./embedding";

package/src/algorithms/planarity/special-graphs.ts

@@ -67,7 +67,7 @@ export function isK33(nodes: Node[], edges: Edge[]): boolean {
  * @param edges - List of edges
  * @returns Array of two partitions, or null if not bipartite
  */
-export function tryFindBipartitePartition(nodes: Node[], edges: Edge[]): [Node[], Node[]] | null {
+function tryFindBipartitePartition(nodes: Node[], edges: Edge[]): [Node[], Node[]] | null {
     const colorMap: Record<Node, number> = {};
     const adjList: Record<Node, Node[]> = {};
 

package/dist/src/algorithms/index.d.ts

@@ -1,6 +0,0 @@
-/**
- * Re-export all algorithm utilities
- */
-export * from "./optimization";
-export * from "./planarity";
-//# sourceMappingURL=index.d.ts.map

package/dist/src/algorithms/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/algorithms/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,cAAc,gBAAgB,CAAC;AAC/B,cAAc,aAAa,CAAC"}

package/dist/src/algorithms/index.js

@@ -1,6 +0,0 @@
-/**
- * Re-export all algorithm utilities
- */
-export * from "./optimization";
-export * from "./planarity";
-//# sourceMappingURL=index.js.map

package/dist/src/algorithms/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/algorithms/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,cAAc,gBAAgB,CAAC;AAC/B,cAAc,aAAa,CAAC"}

package/src/algorithms/index.ts

@@ -1,6 +0,0 @@
-/**
- * Re-export all algorithm utilities
- */
-
-export * from "./optimization";
-export * from "./planarity";