Spaces:
Sleeping
Sleeping
File size: 6,028 Bytes
05c5ed5 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 | import { describe, it, expect } from "vitest";
import { wouldCreateCycle } from "./would-create-cycle";
import { Connection, Edge } from "@xyflow/react";
describe("wouldCreateCycle", () => {
// Helper function to create a connection
const createConnection = (source: string, target: string): Connection => ({
source,
target,
sourceHandle: null,
targetHandle: null,
});
// Helper function to create an edge
const createEdge = (id: string, source: string, target: string): Edge => ({
id,
source,
target,
sourceHandle: null,
targetHandle: null,
});
it("should return false for empty graph", () => {
const connection = createConnection("A", "B");
const existingEdges: Edge[] = [];
const result = wouldCreateCycle(connection, existingEdges);
expect(result).toBe(false);
});
it("should return false for simple linear connection", () => {
const connection = createConnection("B", "C");
const existingEdges = [createEdge("1", "A", "B")];
const result = wouldCreateCycle(connection, existingEdges);
expect(result).toBe(false);
});
it("should return true for direct cycle (A -> B -> A)", () => {
const connection = createConnection("B", "A");
const existingEdges = [createEdge("1", "A", "B")];
const result = wouldCreateCycle(connection, existingEdges);
expect(result).toBe(true);
});
it("should return true for indirect cycle (A -> B -> C -> A)", () => {
const connection = createConnection("C", "A");
const existingEdges = [
createEdge("1", "A", "B"),
createEdge("2", "B", "C"),
];
const result = wouldCreateCycle(connection, existingEdges);
expect(result).toBe(true);
});
it("should return true for complex cycle", () => {
const connection = createConnection("D", "B");
const existingEdges = [
createEdge("1", "A", "B"),
createEdge("2", "B", "C"),
createEdge("3", "C", "D"),
createEdge("4", "A", "E"),
createEdge("5", "E", "F"),
];
const result = wouldCreateCycle(connection, existingEdges);
expect(result).toBe(true);
});
it("should return false for branching without cycles", () => {
const connection = createConnection("D", "E");
const existingEdges = [
createEdge("1", "A", "B"),
createEdge("2", "A", "C"),
createEdge("3", "B", "D"),
createEdge("4", "C", "D"),
];
const result = wouldCreateCycle(connection, existingEdges);
expect(result).toBe(false);
});
it("should return false for disconnected components", () => {
const connection = createConnection("D", "E");
const existingEdges = [
createEdge("1", "A", "B"),
createEdge("2", "B", "C"),
createEdge("3", "X", "Y"),
createEdge("4", "Y", "Z"),
];
const result = wouldCreateCycle(connection, existingEdges);
expect(result).toBe(false);
});
it("should handle self-loop correctly", () => {
const connection = createConnection("A", "A");
const existingEdges: Edge[] = [];
const result = wouldCreateCycle(connection, existingEdges);
expect(result).toBe(true);
});
it("should return false when connection source or target is missing", () => {
const connectionWithoutSource = {
source: null,
target: "B",
sourceHandle: null,
targetHandle: null,
} as unknown as Connection;
const connectionWithoutTarget = {
source: "A",
target: null,
sourceHandle: null,
targetHandle: null,
} as unknown as Connection;
const existingEdges = [createEdge("1", "A", "B")];
expect(wouldCreateCycle(connectionWithoutSource, existingEdges)).toBe(
false,
);
expect(wouldCreateCycle(connectionWithoutTarget, existingEdges)).toBe(
false,
);
});
it("should detect cycle in diamond shape graph", () => {
const connection = createConnection("D", "A");
const existingEdges = [
createEdge("1", "A", "B"),
createEdge("2", "A", "C"),
createEdge("3", "B", "D"),
createEdge("4", "C", "D"),
];
const result = wouldCreateCycle(connection, existingEdges);
expect(result).toBe(true);
});
it("should handle large graph with multiple paths without cycle", () => {
const connection = createConnection("F", "G");
const existingEdges = [
createEdge("1", "A", "B"),
createEdge("2", "A", "C"),
createEdge("3", "B", "D"),
createEdge("4", "C", "D"),
createEdge("5", "D", "E"),
createEdge("6", "E", "F"),
createEdge("7", "B", "H"),
createEdge("8", "H", "I"),
];
const result = wouldCreateCycle(connection, existingEdges);
expect(result).toBe(false);
});
it("should handle connection between existing isolated nodes", () => {
const connection = createConnection("X", "Y");
const existingEdges = [
createEdge("1", "A", "B"),
createEdge("2", "B", "C"),
];
const result = wouldCreateCycle(connection, existingEdges);
expect(result).toBe(false);
});
it("should detect long cycle path", () => {
const connection = createConnection("E", "A");
const existingEdges = [
createEdge("1", "A", "B"),
createEdge("2", "B", "C"),
createEdge("3", "C", "D"),
createEdge("4", "D", "E"),
];
const result = wouldCreateCycle(connection, existingEdges);
expect(result).toBe(true);
});
it("should return false for single node graph", () => {
const connection = createConnection("A", "B");
const existingEdges: Edge[] = [];
const result = wouldCreateCycle(connection, existingEdges);
expect(result).toBe(false);
});
it("should handle multiple incoming edges to same node", () => {
const connection = createConnection("D", "A");
const existingEdges = [
createEdge("1", "A", "D"),
createEdge("2", "B", "D"),
createEdge("3", "C", "D"),
];
const result = wouldCreateCycle(connection, existingEdges);
expect(result).toBe(true);
});
});
|