@mindfusion/graphs 4.1.1 → 4.2.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/graphs.d.ts CHANGED
@@ -58,6 +58,7 @@ declare module "Graphs/Enum" {
58
58
  export namespace MultipleGraphsPlacement {
59
59
  const Vertical: number;
60
60
  const Horizontal: number;
61
+ const MinimalArea: number;
61
62
  }
62
63
  /**
63
64
  * Specifies general layout orientation.
@@ -704,6 +705,23 @@ declare module "Graphs/Graph" {
704
705
  splitToMaxDegreeV(vertex: any, maxDegree: any, embedding: any): Graph;
705
706
  reorderTopologically(): void;
706
707
  maxWeightedCliqueOfTransitiveDAG(): any[];
708
+ /**
709
+ * Finds and returns all cut vertices (articulation points) in this graph.
710
+ * @returns {Array} An array of cut vertices.
711
+ */
712
+ findCutVertices(): any[];
713
+ /**
714
+ * Calculates Fan-In vs Fan-Out bottlenecks and assigns the results to the weight property of each Vertex.
715
+ * Returns an array of vertices sorted descending by their bottleneck intensity.
716
+ * @returns {Array} An array of vertices sorted descending by weight.
717
+ */
718
+ getFanInFanOutBottlenecks(): any[];
719
+ /**
720
+ * Computes Brandes' Betweenness Centrality for all vertices.
721
+ * Assigns the centrality values to the weight property of each Vertex and returns them sorted descending.
722
+ * @returns {Array} An array of vertices sorted descending by weight.
723
+ */
724
+ getBetweennessCentrality(): any[];
707
725
  }
708
726
  import Vertex from "Graphs/Vertex";
709
727
  import Edge from "Graphs/Edge";
@@ -835,6 +853,9 @@ declare module "Graphs/PathFinder" {
835
853
  static enumAllCycles(graph: any): any[];
836
854
  static enumAllCyclesDirected(graph: any, callbackEnum: any): void;
837
855
  static deleted(v: any): any;
856
+ static geometricDistance(v1: any, v2: any): number;
857
+ static generateShortestRoute(graph: any, weight: any): Path;
858
+ static findShortestRoute(graph: any): Path;
838
859
  }
839
860
  import Path from "Graphs/Path";
840
861
  }
package/package.json CHANGED
@@ -4,7 +4,7 @@
4
4
  "email": "info@mindfusion.eu",
5
5
  "url": "https://mindfusion.dev"
6
6
  },
7
- "version": "4.1.1",
7
+ "version": "4.2.1",
8
8
  "description": "Graphs for @mindfusion/diagramming",
9
9
  "keywords": [
10
10
  "graphs library"
@@ -14,28 +14,16 @@
14
14
  "module": "./dist/esm/graphs.js",
15
15
  "exports": {
16
16
  ".": {
17
- "import": {
18
- "types": "./graphs.d.mts",
19
- "default": "./dist/esm/graphs.mjs"
20
- },
21
- "require": {
22
- "types": "./graphs.d.ts",
23
- "default": "./dist/cjs/graphs.js"
24
- },
25
- "node": {
26
- "types": "./graphs.d.mts",
27
- "default": "./dist/esm/graphs.mjs"
28
- },
29
- "default": {
30
- "types": "./graphs.d.ts",
31
- "default": "./dist/cjs/graphs.js"
32
- }
17
+ "types": "./graphs.d.ts",
18
+ "import": "./dist/esm/graphs.mjs",
19
+ "require": "./dist/cjs/graphs.js",
20
+ "default": "./dist/cjs/graphs.js"
33
21
  }
34
- },
22
+ },
35
23
  "license": "SEE LICENSE IN LICENSE.txt",
36
24
  "types": "graphs.d.ts",
37
25
  "dependencies": {
38
- "@mindfusion/collections": "^4.1.0",
39
- "@mindfusion/drawing": "^4.3.0"
26
+ "@mindfusion/collections": "^4.2.0",
27
+ "@mindfusion/drawing": "^4.4.3"
40
28
  }
41
- }
29
+ }