|
| 1 | +// Copyright 2026 Specter Ops, Inc. |
| 2 | +// |
| 3 | +// Licensed under the Apache License, Version 2.0 |
| 4 | +// you may not use this file except in compliance with the License. |
| 5 | +// You may obtain a copy of the License at |
| 6 | +// |
| 7 | +// http://www.apache.org/licenses/LICENSE-2.0 |
| 8 | +// |
| 9 | +// Unless required by applicable law or agreed to in writing, software |
| 10 | +// distributed under the License is distributed on an "AS IS" BASIS, |
| 11 | +// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 12 | +// See the License for the specific language governing permissions and |
| 13 | +// limitations under the License. |
| 14 | +// |
| 15 | +// SPDX-License-Identifier: Apache-2.0 |
| 16 | + |
| 17 | +import { MultiDirectedGraph } from 'graphology'; |
| 18 | +import { getFullPathHighlightedEntities, getIsHighlightedItemInGraph } from './utils'; |
| 19 | + |
| 20 | +// Linear directed graph with a split inbound on node-c: |
| 21 | +// node-a → node-b → node-c ← node-d |
| 22 | +const buildTestGraph = () => { |
| 23 | + const graph = new MultiDirectedGraph(); |
| 24 | + graph.addNode('node-a'); |
| 25 | + graph.addNode('node-b'); |
| 26 | + graph.addNode('node-c'); |
| 27 | + graph.addNode('node-d'); |
| 28 | + graph.addDirectedEdgeWithKey('edge-ab', 'node-a', 'node-b'); |
| 29 | + graph.addDirectedEdgeWithKey('edge-bc', 'node-b', 'node-c'); |
| 30 | + graph.addDirectedEdgeWithKey('edge-dc', 'node-d', 'node-c'); |
| 31 | + return graph; |
| 32 | +}; |
| 33 | + |
| 34 | +describe('SigmaChart Utils', () => { |
| 35 | + let graph: MultiDirectedGraph; |
| 36 | + |
| 37 | + beforeEach(() => { |
| 38 | + graph = buildTestGraph(); |
| 39 | + }); |
| 40 | + |
| 41 | + describe('getIsHighlightedItemInGraph', () => { |
| 42 | + it('returns true when the highlighted item is a node in the graph', () => { |
| 43 | + expect(getIsHighlightedItemInGraph(graph, 'node-a')).toBe(true); |
| 44 | + }); |
| 45 | + |
| 46 | + it('returns true when the highlighted item is an edge in the graph', () => { |
| 47 | + expect(getIsHighlightedItemInGraph(graph, 'edge-ab')).toBe(true); |
| 48 | + }); |
| 49 | + |
| 50 | + it('returns undefined when highlightedItem is null', () => { |
| 51 | + expect(getIsHighlightedItemInGraph(graph, null)).toBeUndefined(); |
| 52 | + }); |
| 53 | + |
| 54 | + it('returns false when the highlighted item is not in the graph', () => { |
| 55 | + expect(getIsHighlightedItemInGraph(graph, 'node-unknown')).toBe(false); |
| 56 | + }); |
| 57 | + }); |
| 58 | + |
| 59 | + describe('getFullPathHighlightedEntities', () => { |
| 60 | + describe('when a node is selected', () => { |
| 61 | + it('returns the full inbound and outbound path when selecting a middle node', () => { |
| 62 | + const { highlightedNodeIds, highlightedEdgeIds } = getFullPathHighlightedEntities(graph, 'node-b'); |
| 63 | + |
| 64 | + expect([...highlightedNodeIds]).toEqual(expect.arrayContaining(['node-a', 'node-b', 'node-c'])); |
| 65 | + expect([...highlightedEdgeIds]).toEqual(expect.arrayContaining(['edge-ab', 'edge-bc'])); |
| 66 | + }); |
| 67 | + |
| 68 | + it('returns only the outbound path when selecting the start node', () => { |
| 69 | + const { highlightedNodeIds, highlightedEdgeIds } = getFullPathHighlightedEntities(graph, 'node-a'); |
| 70 | + |
| 71 | + expect([...highlightedNodeIds]).toEqual(expect.arrayContaining(['node-a', 'node-b', 'node-c'])); |
| 72 | + expect([...highlightedEdgeIds]).toEqual(expect.arrayContaining(['edge-ab', 'edge-bc'])); |
| 73 | + }); |
| 74 | + |
| 75 | + it('returns all inbound paths when selecting the end node with multiple inbound edges', () => { |
| 76 | + const { highlightedNodeIds, highlightedEdgeIds } = getFullPathHighlightedEntities(graph, 'node-c'); |
| 77 | + |
| 78 | + expect([...highlightedNodeIds]).toEqual( |
| 79 | + expect.arrayContaining(['node-a', 'node-b', 'node-c', 'node-d']) |
| 80 | + ); |
| 81 | + expect([...highlightedEdgeIds]).toEqual(expect.arrayContaining(['edge-ab', 'edge-bc', 'edge-dc'])); |
| 82 | + }); |
| 83 | + |
| 84 | + it('returns only the selected node when it has no connections', () => { |
| 85 | + const isolatedGraph = new MultiDirectedGraph(); |
| 86 | + isolatedGraph.addNode('node-isolated'); |
| 87 | + const { highlightedNodeIds, highlightedEdgeIds } = getFullPathHighlightedEntities( |
| 88 | + isolatedGraph, |
| 89 | + 'node-isolated' |
| 90 | + ); |
| 91 | + |
| 92 | + expect([...highlightedNodeIds]).toEqual(['node-isolated']); |
| 93 | + expect(highlightedEdgeIds.size).toBe(0); |
| 94 | + }); |
| 95 | + }); |
| 96 | + |
| 97 | + describe('when an edge is selected', () => { |
| 98 | + it('returns the edge and both of its endpoint nodes', () => { |
| 99 | + const { highlightedNodeIds, highlightedEdgeIds } = getFullPathHighlightedEntities(graph, 'edge-ab'); |
| 100 | + |
| 101 | + expect([...highlightedNodeIds]).toEqual(expect.arrayContaining(['node-a', 'node-b'])); |
| 102 | + expect([...highlightedEdgeIds]).toEqual(['edge-ab']); |
| 103 | + }); |
| 104 | + }); |
| 105 | + |
| 106 | + it('returns empty sets when highlightedItem is null', () => { |
| 107 | + const { highlightedNodeIds, highlightedEdgeIds } = getFullPathHighlightedEntities(graph, null); |
| 108 | + |
| 109 | + expect(highlightedNodeIds.size).toBe(0); |
| 110 | + expect(highlightedEdgeIds.size).toBe(0); |
| 111 | + }); |
| 112 | + }); |
| 113 | +}); |
0 commit comments