directed-graph-typed 2.4.4 → 2.5.0

package/README.md

@@ -79,57 +79,6 @@ yarn add directed-graph-typed
     console.log(neighborsA[1].key); // 'C';
 ```
 
-### DirectedGraph deleteEdge and vertex operations
-```typescript
- const graph = new DirectedGraph<string>();
-
-    // Build a small graph
-    graph.addVertex('X');
-    graph.addVertex('Y');
-    graph.addVertex('Z');
-    graph.addEdge('X', 'Y', 1);
-    graph.addEdge('Y', 'Z', 2);
-
-    // Delete an edge
-    graph.deleteEdgeSrcToDest('X', 'Y');
-    console.log(graph.hasEdge('X', 'Y')); // false;
-
-    // Edge in other direction should not exist
-    console.log(graph.hasEdge('Y', 'X')); // false;
-
-    // Other edges should remain
-    console.log(graph.hasEdge('Y', 'Z')); // true;
-
-    // Delete a vertex
-    graph.deleteVertex('Y');
-    console.log(graph.hasVertex('Y')); // false;
-    console.log(graph.size); // 2;
-```
-
-### DirectedGraph topologicalSort for task scheduling
-```typescript
- const graph = new DirectedGraph<string>();
-
-    // Build a DAG (Directed Acyclic Graph) for task dependencies
-    graph.addVertex('Design');
-    graph.addVertex('Implement');
-    graph.addVertex('Test');
-    graph.addVertex('Deploy');
-
-    // Add dependency edges
-    graph.addEdge('Design', 'Implement', 1); // Design must come before Implement
-    graph.addEdge('Implement', 'Test', 1); // Implement must come before Test
-    graph.addEdge('Test', 'Deploy', 1); // Test must come before Deploy
-
-    // Topological sort gives valid execution order
-    const executionOrder = graph.topologicalSort();
-    console.log(executionOrder); // defined;
-    console.log(executionOrder); // ['Design', 'Implement', 'Test', 'Deploy'];
-
-    // All vertices should be included
-    console.log(executionOrder?.length); // 4;
-```
-
 ### DirectedGraph dijkstra shortest path for network routing
 ```typescript
  // Build a weighted directed graph representing network nodes and costs