| 642 | } |
| 643 | |
| 644 | function buildGraph(): Graph { |
| 645 | const nodeA = { |
| 646 | id: "node-a", |
| 647 | outEdges: [], |
| 648 | inEdges: [], |
| 649 | } as unknown as Graph["nodes"][number]; |
| 650 | const nodeB = { |
| 651 | id: "node-b", |
| 652 | outEdges: [], |
| 653 | inEdges: [], |
| 654 | } as unknown as Graph["nodes"][number]; |
| 655 | const edge = { |
| 656 | id: "edge-1", |
| 657 | weight: 1.5, |
| 658 | from_: nodeA, |
| 659 | to: nodeB, |
| 660 | } as Graph["edges"][number]; |
| 661 | nodeA.outEdges = [edge]; |
| 662 | nodeA.inEdges = [edge]; |
| 663 | nodeB.inEdges = [edge]; |
| 664 | nodeB.outEdges = []; |
| 665 | return { |
| 666 | nodes: [nodeA, nodeB], |
| 667 | edges: [edge], |
| 668 | }; |
| 669 | } |
| 670 | |
| 671 | function assertAddressBookEqual(expected: AddressBook, actual: unknown): void { |
| 672 | assertAcyclicEqual("addressbook", expected, actual); |