react-pert 1.0.0-beta.1

package/LICENSE.md

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2024 Youcef Hammadi [@ucfx](https://github.com/ucfx)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,184 @@
+<h1 align="center">pert-react</h1>
+
+## :star2: Overview
+
+This package provides tools to calculate and visualize a PERT (Program Evaluation and Review Technique) diagram. It includes the following components and utilities:
+
+- **`PertProvider`**: A context provider for managing and accessing PERT data.
+- **`Pert`**: A component to render the PERT diagram (currently under development).
+- **`usePertData`**: A custom hook to retrieve PERT results.
+
+### :rocket: Progress
+
+- :white_check_mark: **PERT Calculator**: Fully functional.
+- :construction: **PERT Diagram**: Currently under development.
+
+---
+
+## :clipboard: Installation
+
+Install the package via npm:
+
+```bash
+npm install react-pert
+```
+
+---
+
+## :book: Usage
+
+### Setup with `PertProvider`
+
+Wrap your application or a specific part of it with `PertProvider` to provide context for managing PERT data:
+
+> **Note**: The `Pert` component is under development and may not be fully functional yet.
+
+```jsx
+import { Pert, PertProvider, type TaskType } from "react-pert";
+
+const App = () => {
+  const tasks: TaskType[] = [
+    { key: "1", duration: 5, text: "A" },
+    { key: "2", duration: 4, text: "B" },
+    { key: "3", duration: 2, text: "C", dependsOn: ["1"] },
+    { key: "4", duration: 3, text: "D", dependsOn: ["2"] },
+    ...
+  ];
+
+  return (
+    <PertProvider>
+      <Pert tasks={tasks} /> /* PERT diagram currently under development */
+      <PertDetails />
+    </PertProvider>
+  );
+};
+```
+
+---
+
+### Using `usePertData` Hook
+
+The `usePertData` hook allows you to calculate and retrieve PERT results. Here's how you can use it:
+
+```jsx
+import { usePertData } from "react-pert";
+
+const PertDetails = () => {
+  const { tasks, criticalPaths } = usePertData();
+
+  return (
+    <div>
+      <h3>Project Duration : {tasks[tasks.length - 1]?.lateStart}</h3>
+      <h3>Critical Paths:</h3>
+      <div>
+        {criticalPaths.map((cp, index) => (
+          <div key={index}>
+            {cp.map((p, i) => (
+              <label key={i}>
+                <span>{p.text}</span>
+                {i !== cp.length - 1 && <span> {"→"}</span>}
+              </label>
+            ))}
+          </div>
+        ))}
+      </div>
+    </div>
+  );
+};
+```
+
+---
+
+## :books: API Reference
+
+### `PertProps`
+
+| Attribute | Type                      | Description                                                     |
+| --------- | ------------------------- | --------------------------------------------------------------- |
+| `tasks`   | [`TaskType[]`](#TaskType) | Array of tasks to be used for the calculation and PERT diagram. |
+
+### `Pert`
+
+A visual representation of the PERT diagram (currently in development).
+
+---
+
+### `usePertData`
+
+#### Returns:
+
+- **`PertDataType`**: Contains all PERT data including tasks, levels, links, and critical paths.
+
+### `PertDataType`
+
+| Attribute       | Type                                      | Description                                                 |
+| --------------- | ----------------------------------------- | ----------------------------------------------------------- |
+| `tasks`         | [`TaskResultType[]`](#TaskResultType)     | Array of tasks with PERT calculation results.               |
+| `levels`        | [`LevelType`](#LevelType)                 | Mapping of task keys to their respective levels.            |
+| `links`         | [`LinkType[]`](#LinkType)                 | Array of links representing the dependencies between tasks. |
+| `criticalPaths` | [`CriticalPathType[]`](#CriticalPathType) | Array of critical paths in the project.                     |
+
+### `TaskType`
+
+| Attribute    | Type       | Description                                                     |
+| ------------ | ---------- | --------------------------------------------------------------- |
+| `key`        | `string`   | Unique identifier for the task.                                 |
+| `text`       | `string`   | Description or name of the task.                                |
+| `duration`   | `number`   | Duration of the task in some unit (e.g., days).                 |
+| `dependsOn?` | `string[]` | Array of task keys that the current task depends on (optional). |
+
+### `TaskResultType`
+
+| Attribute     | Type      | Description                                  |
+| ------------- | --------- | -------------------------------------------- |
+| `earlyStart`  | `number`  | The earliest start time for the task.        |
+| `earlyFinish` | `number`  | The earliest finish time for the task.       |
+| `lateStart`   | `number`  | The latest start time for the task.          |
+| `lateFinish`  | `number`  | The latest finish time for the task.         |
+| `level`       | `number`  | The level of the task in the PERT diagram.   |
+| `critical`    | `boolean` | Indicates if the task is on a critical path. |
+| `freeFloat`   | `number`  | The free float time of the task.             |
+| `totalFloat`  | `number`  | The total float time of the task.            |
+| `index`       | `number`  | Index of the task in the sequence.           |
+
+### `LevelType`
+
+| Attribute | Type       | Description                               |
+| --------- | ---------- | ----------------------------------------- |
+| `key`     | `string`   | The task key.                             |
+| `value`   | `string[]` | Array of task keys at the specific level. |
+
+### `LinkType`
+
+| Attribute  | Type      | Description                                       |
+| ---------- | --------- | ------------------------------------------------- |
+| `from`     | `string`  | The task key from which the link originates.      |
+| `to`       | `string`  | The task key to which the link leads.             |
+| `critical` | `boolean` | Indicates if the link is part of a critical path. |
+
+### `PathItemType`
+
+| Attribute | Type     | Description                                        |
+| --------- | -------- | -------------------------------------------------- |
+| `text`    | `string` | Text description of the task on the critical path. |
+| `key`     | `string` | The key of the task on the critical path.          |
+
+### `CriticalPathType`
+
+|                    | Type             | Description                                                                                                     |
+| ------------------ | ---------------- | --------------------------------------------------------------------------------------------------------------- |
+| `CriticalPathType` | `PathItemType[]` | An array of tasks (`PathItemType`) forming the critical path. Each element contains the task's `text` and `key` |
+
+---
+
+## :handshake: Contributing
+
+We welcome contributions! If you encounter any bugs or have feature requests, please open an issue or submit a pull request.
+
+---
+
+## :page_with_curl: License
+
+This package is open-source and licensed under the [MIT License](LICENSE.md).
+
+Enjoy building with **PERT Diagram**! :relaxed:

package/dist/index.d.ts

@@ -0,0 +1,59 @@
+import { JSX as JSX_2 } from 'react/jsx-runtime';
+import { ReactNode } from 'react';
+
+export declare type CriticalPathType = PathItemType[];
+
+export declare type LevelType = {
+    [key: string]: string[];
+};
+
+export declare type LinkType = {
+    from: string;
+    to: string;
+    critical: boolean;
+};
+
+declare type PathItemType = {
+    text: string;
+    key: string;
+};
+
+export declare function Pert({ tasks }: PertProps): JSX_2.Element;
+
+export declare type PertDataType = {
+    tasks: TaskResultType[];
+    levels: LevelType;
+    links: LinkType[];
+    criticalPaths: CriticalPathType[];
+};
+
+export declare type PertProps = {
+    tasks: TaskType[];
+};
+
+export declare const PertProvider: ({ children }: {
+    children: ReactNode;
+}) => JSX_2.Element;
+
+export declare type TaskResultType = TaskType & {
+    earlyStart: number;
+    earlyFinish: number;
+    lateStart: number;
+    lateFinish: number;
+    level: number;
+    critical: boolean;
+    freeFloat: number;
+    totalFloat: number;
+    index: number;
+};
+
+export declare type TaskType = {
+    key: string;
+    text: string;
+    duration: number;
+    dependsOn?: string[];
+};
+
+export declare const usePertData: () => PertDataType;
+
+export { }

package/dist/index.js

@@ -0,0 +1,216 @@
+var k = Object.defineProperty;
+var f = (l, e, s) => e in l ? k(l, e, { enumerable: !0, configurable: !0, writable: !0, value: s }) : l[e] = s;
+var n = (l, e, s) => f(l, typeof e != "symbol" ? e + "" : e, s);
+import { jsx as p, Fragment as v } from "react/jsx-runtime";
+import { createContext as P, useState as T, useContext as y, useEffect as u } from "react";
+const d = () => Math.random().toString(36).substring(7);
+let g = class {
+  constructor(e) {
+    n(this, "levels");
+    n(this, "tasksMap");
+    n(this, "initialData");
+    n(this, "links");
+    n(this, "criticalPaths");
+    n(this, "tasks");
+    n(this, "lastTaskKey");
+    n(this, "startTaskKey");
+    this.initialData = e, this.tasksMap = /* @__PURE__ */ new Map(), this.lastTaskKey = `Finish-${d()}`, this.startTaskKey = `Start-${d()}`, this.levels = {}, this.links = [], this.criticalPaths = [], this.tasks = [];
+  }
+  convertDataToMap() {
+    this.tasksMap = /* @__PURE__ */ new Map(), this.tasksMap.set(this.startTaskKey, {
+      key: this.startTaskKey,
+      duration: 0,
+      text: "Start"
+    }), this.initialData.forEach((e, s) => {
+      if (this.tasksMap.has(e.key)) throw Error(`Duplicate keys found ${e.key}`);
+      this.tasksMap.set(
+        e.key,
+        !e.dependsOn || e.dependsOn.length === 0 ? { ...e, dependsOn: [this.startTaskKey], index: s } : { ...e, index: s }
+      );
+    });
+  }
+  calculatePERT() {
+    this.convertDataToMap(), this.calcLevels();
+    let e = Object.keys(this.levels).map((t) => parseInt(t));
+    e.forEach((t) => {
+      this.levels[t].forEach((a) => {
+        this.calculateEarlyTimes(a);
+      });
+    });
+    let s = Array.from(this.tasksMap.values()).reduce(
+      (t, a) => t.earlyFinish > a.earlyFinish ? t : a
+    );
+    s.lateFinish = s.earlyFinish, s.critical = !0, this.tasksMap.set(this.lastTaskKey, {
+      key: this.lastTaskKey,
+      text: "Finish",
+      dependsOn: [s.key],
+      duration: 0,
+      earlyStart: s.earlyFinish,
+      earlyFinish: s.earlyFinish,
+      lateFinish: s.earlyFinish,
+      lateStart: s.earlyFinish,
+      level: e.length,
+      critical: !0,
+      freeFloat: 0,
+      totalFloat: 0,
+      index: this.tasksMap.size - 1
+    }), this.levels[e.length] = [this.lastTaskKey];
+    for (let t = e.length - 1; t >= 0; t--)
+      this.levels[e[t]].forEach((a) => {
+        this.calculateLateTimes(a, s.lateFinish);
+      });
+    e.forEach((t) => {
+      this.levels[t] = this.levels[t].sort(
+        (a, i) => this.tasksMap.get(a).index - this.tasksMap.get(i).index
+      );
+    }), this.tasks = Array.from(this.tasksMap.values());
+  }
+  getSuccessors(e) {
+    return Array.from(this.tasksMap.values()).filter(
+      (s) => s.dependsOn && s.dependsOn.includes(e.key)
+    );
+  }
+  calculateEarlyTimes(e) {
+    const s = this.tasksMap.get(e);
+    if (!s.dependsOn)
+      s.earlyStart = 0;
+    else {
+      let t = 0;
+      s.dependsOn.forEach((a) => {
+        const i = this.tasksMap.get(a);
+        t = Math.max(
+          t,
+          i.earlyStart + i.duration
+        );
+      }), s.earlyStart = t;
+    }
+    s.earlyFinish = s.earlyStart + s.duration;
+  }
+  calculateLateTimes(e, s) {
+    const t = this.tasksMap.get(e), a = this.getSuccessors(t);
+    let i = a.length === 0 ? s : Math.min(...a.map((r) => r.lateFinish - r.duration));
+    t.lateFinish = i, t.lateStart = t.lateFinish - t.duration, t.critical = t.earlyFinish === t.lateFinish, t.critical ? (t.freeFloat = 0, t.totalFloat = 0) : (t.freeFloat = (a.length === 0 ? s : Math.min(...a.map((r) => r.earlyStart))) - t.earlyFinish, t.totalFloat = t.lateFinish - t.earlyFinish);
+  }
+  calcLevels() {
+    this.levels = {};
+    let e = [];
+    const s = (t) => {
+      if (e.includes(t.key))
+        throw new Error("Circular dependency detected");
+      if (!t.dependsOn || t.dependsOn.length === 0)
+        t.level = 0;
+      else {
+        let a = 0;
+        t.dependsOn.forEach((i) => {
+          const r = this.tasksMap.get(i);
+          if (!r)
+            throw new Error(`Task with KEY '${i}' was not found.`);
+          r.level === void 0 && (e.push(t.key), s(r)), a = Math.max(a, r.level + 1);
+        }), t.level = a;
+      }
+      this.levels[t.level] || (this.levels[t.level] = []), this.levels[t.level].includes(t.key) || this.levels[t.level].push(t.key);
+    };
+    this.tasksMap.forEach((t) => {
+      e = [], s(t);
+    });
+  }
+  calcNodeLinks() {
+    const e = [], s = [];
+    this.tasksMap.forEach((t, a) => {
+      t.dependsOn ? t.dependsOn.forEach((i) => {
+        s.push(i), e.push({
+          from: i,
+          to: t.key,
+          critical: t.critical && this.tasksMap.get(i).critical
+        });
+      }) : a !== this.startTaskKey && e.push({
+        from: this.startTaskKey,
+        to: t.key,
+        critical: t.critical
+      });
+    }), this.tasksMap.forEach((t) => {
+      !s.includes(t.key) && t.key !== this.lastTaskKey && e.push({
+        from: t.key,
+        to: this.lastTaskKey,
+        critical: t.critical
+      });
+    }), this.links = e;
+  }
+  calcCriticalPaths() {
+    this.calcNodeLinks();
+    const e = [];
+    this.links.filter(
+      (t) => t.critical && t.from === this.startTaskKey && t.to !== this.lastTaskKey
+    ).forEach((t) => {
+      const a = [t], i = (r) => {
+        const o = this.links.filter(
+          (h) => h.critical && h.from === r.to && h.to !== this.lastTaskKey
+        );
+        o.length === 0 ? e.push(
+          a.map((h) => ({
+            text: this.tasksMap.get(h.to).text,
+            key: h.to
+          }))
+        ) : o.forEach((h) => {
+          a.push(h), i(h), a.pop();
+        });
+      };
+      i(t);
+    }), this.criticalPaths = e;
+  }
+  getTasks() {
+    return this.calculatePERT(), this.tasks;
+  }
+  getCriticalPaths() {
+    return this.criticalPaths.length === 0 && this.calcCriticalPaths(), this.criticalPaths;
+  }
+  getLevels() {
+    return this.levels;
+  }
+  getNodeLinks() {
+    return this.links;
+  }
+  solve() {
+    return {
+      tasks: this.getTasks(),
+      levels: this.getLevels(),
+      criticalPaths: this.getCriticalPaths(),
+      links: this.getNodeLinks()
+    };
+  }
+};
+const M = {
+  tasks: [],
+  levels: {},
+  links: [],
+  criticalPaths: []
+}, c = P(null), w = ({ children: l }) => {
+  const [e, s] = T(M), t = (a) => {
+    const i = new g(a).solve();
+    s(i);
+  };
+  return /* @__PURE__ */ p(c.Provider, { value: { pertData: e, calculatePertResults: t }, children: l });
+}, S = () => {
+  const l = y(c);
+  if (!l)
+    throw new Error("usePertData must be used within a PertProvider");
+  return l.pertData;
+}, m = () => {
+  const l = y(c);
+  if (!l)
+    throw new Error("usePertContext must be used within a PertProvider");
+  return l;
+};
+function O({ tasks: l }) {
+  const { pertData: e, calculatePertResults: s } = m();
+  return u(() => {
+    s(l);
+  }, [l]), u(() => {
+    console.log("data", e);
+  }, [e]), /* @__PURE__ */ p(v, { children: "PertChart" });
+}
+export {
+  O as Pert,
+  w as PertProvider,
+  S as usePertData
+};

package/dist/index.umd.cjs

@@ -0,0 +1 @@
+(function(l,r){typeof exports=="object"&&typeof module<"u"?r(exports,require("react/jsx-runtime"),require("react")):typeof define=="function"&&define.amd?define(["exports","react/jsx-runtime","react"],r):(l=typeof globalThis<"u"?globalThis:l||self,r(l["react-pert"]={},l["react/jsx-runtime"],l.React))})(this,function(l,r,n){"use strict";var g=Object.defineProperty;var m=(l,r,n)=>r in l?g(l,r,{enumerable:!0,configurable:!0,writable:!0,value:n}):l[r]=n;var u=(l,r,n)=>m(l,typeof r!="symbol"?r+"":r,n);const f=()=>Math.random().toString(36).substring(7);let y=class{constructor(e){u(this,"levels");u(this,"tasksMap");u(this,"initialData");u(this,"links");u(this,"criticalPaths");u(this,"tasks");u(this,"lastTaskKey");u(this,"startTaskKey");this.initialData=e,this.tasksMap=new Map,this.lastTaskKey=`Finish-${f()}`,this.startTaskKey=`Start-${f()}`,this.levels={},this.links=[],this.criticalPaths=[],this.tasks=[]}convertDataToMap(){this.tasksMap=new Map,this.tasksMap.set(this.startTaskKey,{key:this.startTaskKey,duration:0,text:"Start"}),this.initialData.forEach((e,s)=>{if(this.tasksMap.has(e.key))throw Error(`Duplicate keys found ${e.key}`);this.tasksMap.set(e.key,!e.dependsOn||e.dependsOn.length===0?{...e,dependsOn:[this.startTaskKey],index:s}:{...e,index:s})})}calculatePERT(){this.convertDataToMap(),this.calcLevels();let e=Object.keys(this.levels).map(t=>parseInt(t));e.forEach(t=>{this.levels[t].forEach(a=>{this.calculateEarlyTimes(a)})});let s=Array.from(this.tasksMap.values()).reduce((t,a)=>t.earlyFinish>a.earlyFinish?t:a);s.lateFinish=s.earlyFinish,s.critical=!0,this.tasksMap.set(this.lastTaskKey,{key:this.lastTaskKey,text:"Finish",dependsOn:[s.key],duration:0,earlyStart:s.earlyFinish,earlyFinish:s.earlyFinish,lateFinish:s.earlyFinish,lateStart:s.earlyFinish,level:e.length,critical:!0,freeFloat:0,totalFloat:0,index:this.tasksMap.size-1}),this.levels[e.length]=[this.lastTaskKey];for(let t=e.length-1;t>=0;t--)this.levels[e[t]].forEach(a=>{this.calculateLateTimes(a,s.lateFinish)});e.forEach(t=>{this.levels[t]=this.levels[t].sort((a,i)=>this.tasksMap.get(a).index-this.tasksMap.get(i).index)}),this.tasks=Array.from(this.tasksMap.values())}getSuccessors(e){return Array.from(this.tasksMap.values()).filter(s=>s.dependsOn&&s.dependsOn.includes(e.key))}calculateEarlyTimes(e){const s=this.tasksMap.get(e);if(!s.dependsOn)s.earlyStart=0;else{let t=0;s.dependsOn.forEach(a=>{const i=this.tasksMap.get(a);t=Math.max(t,i.earlyStart+i.duration)}),s.earlyStart=t}s.earlyFinish=s.earlyStart+s.duration}calculateLateTimes(e,s){const t=this.tasksMap.get(e),a=this.getSuccessors(t);let i=a.length===0?s:Math.min(...a.map(c=>c.lateFinish-c.duration));t.lateFinish=i,t.lateStart=t.lateFinish-t.duration,t.critical=t.earlyFinish===t.lateFinish,t.critical?(t.freeFloat=0,t.totalFloat=0):(t.freeFloat=(a.length===0?s:Math.min(...a.map(c=>c.earlyStart)))-t.earlyFinish,t.totalFloat=t.lateFinish-t.earlyFinish)}calcLevels(){this.levels={};let e=[];const s=t=>{if(e.includes(t.key))throw new Error("Circular dependency detected");if(!t.dependsOn||t.dependsOn.length===0)t.level=0;else{let a=0;t.dependsOn.forEach(i=>{const c=this.tasksMap.get(i);if(!c)throw new Error(`Task with KEY '${i}' was not found.`);c.level===void 0&&(e.push(t.key),s(c)),a=Math.max(a,c.level+1)}),t.level=a}this.levels[t.level]||(this.levels[t.level]=[]),this.levels[t.level].includes(t.key)||this.levels[t.level].push(t.key)};this.tasksMap.forEach(t=>{e=[],s(t)})}calcNodeLinks(){const e=[],s=[];this.tasksMap.forEach((t,a)=>{t.dependsOn?t.dependsOn.forEach(i=>{s.push(i),e.push({from:i,to:t.key,critical:t.critical&&this.tasksMap.get(i).critical})}):a!==this.startTaskKey&&e.push({from:this.startTaskKey,to:t.key,critical:t.critical})}),this.tasksMap.forEach(t=>{!s.includes(t.key)&&t.key!==this.lastTaskKey&&e.push({from:t.key,to:this.lastTaskKey,critical:t.critical})}),this.links=e}calcCriticalPaths(){this.calcNodeLinks();const e=[];this.links.filter(t=>t.critical&&t.from===this.startTaskKey&&t.to!==this.lastTaskKey).forEach(t=>{const a=[t],i=c=>{const p=this.links.filter(o=>o.critical&&o.from===c.to&&o.to!==this.lastTaskKey);p.length===0?e.push(a.map(o=>({text:this.tasksMap.get(o.to).text,key:o.to}))):p.forEach(o=>{a.push(o),i(o),a.pop()})};i(t)}),this.criticalPaths=e}getTasks(){return this.calculatePERT(),this.tasks}getCriticalPaths(){return this.criticalPaths.length===0&&this.calcCriticalPaths(),this.criticalPaths}getLevels(){return this.levels}getNodeLinks(){return this.links}solve(){return{tasks:this.getTasks(),levels:this.getLevels(),criticalPaths:this.getCriticalPaths(),links:this.getNodeLinks()}}};const k={tasks:[],levels:{},links:[],criticalPaths:[]},d=n.createContext(null),v=({children:h})=>{const[e,s]=n.useState(k),t=a=>{const i=new y(a).solve();s(i)};return r.jsx(d.Provider,{value:{pertData:e,calculatePertResults:t},children:h})},P=()=>{const h=n.useContext(d);if(!h)throw new Error("usePertData must be used within a PertProvider");return h.pertData},T=()=>{const h=n.useContext(d);if(!h)throw new Error("usePertContext must be used within a PertProvider");return h};function M({tasks:h}){const{pertData:e,calculatePertResults:s}=T();return n.useEffect(()=>{s(h)},[h]),n.useEffect(()=>{console.log("data",e)},[e]),r.jsx(r.Fragment,{children:"PertChart"})}l.Pert=M,l.PertProvider=v,l.usePertData=P,Object.defineProperty(l,Symbol.toStringTag,{value:"Module"})});

package/package.json

@@ -0,0 +1,71 @@
+{
+  "name": "react-pert",
+  "version": "1.0.0-beta.1",
+  "type": "module",
+  "files": [
+    "dist",
+    "README.md",
+    "LICENSE.md"
+  ],
+  "main": "./dist/index.umd.cjs",
+  "module": "./dist/index.js",
+  "exports": {
+    ".": {
+      "import": "./dist/index.js",
+      "require": "./dist/index.umd.cjs"
+    }
+  },
+  "types": "./dist/index.d.ts",
+  "sideEffects": false,
+  "publishConfig": {
+    "access": "public"
+  },
+  "homepage": "https://github.com/ucfx/react-pert#readme",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/ucfx/react-pert"
+  },
+  "author": {
+    "name": "Youcef Hammadi",
+    "email": "ucefhammadi@gmail.com"
+  },
+  "scripts": {
+    "dev": "vite",
+    "prebuild": "rimraf dist",
+    "build": "tsc -b && vite build",
+    "lint": "eslint . --ext ts,tsx --report-unused-disable-directives --max-warnings 0",
+    "semantic-release": "semantic-release"
+  },
+  "dependencies": {
+    "react": "^18.3.1",
+    "react-dom": "^18.3.1"
+  },
+  "devDependencies": {
+    "@eslint/js": "^9.11.1",
+    "@types/node": "^22.7.5",
+    "@types/react": "^18.3.10",
+    "@types/react-dom": "^18.3.0",
+    "@vitejs/plugin-react": "^4.3.2",
+    "eslint": "^9.11.1",
+    "eslint-plugin-react-hooks": "^5.1.0-rc.0",
+    "eslint-plugin-react-refresh": "^0.4.12",
+    "globals": "^15.9.0",
+    "rimraf": "^6.0.1",
+    "semantic-release": "^24.1.2",
+    "typescript": "^5.5.3",
+    "typescript-eslint": "^8.7.0",
+    "vite": "^5.4.8",
+    "vite-plugin-dts": "^4.2.4",
+    "vite-tsconfig-paths": "^5.0.1"
+  },
+  "keywords": [
+    "react",
+    "pert",
+    "pert chart",
+    "react-pert",
+    "react pert",
+    "graph",
+    "diagram",
+    "chart"
+  ]
+}