I need to draw a graph. I chose Brandes-Köpf positioning algorithm. Also I found a reference implementation: see this file: `/home/pavlo-myroniuk/delete_it/dagrejs/dagre/lib/position/bk.js`.

I want you to do the following tasks:
1. Read the attached file
2. Write the same algorithm in the `fullGraph.ts` file, but follow the following instructions:
- Remove all logic related to conflicts: conflicts finding, conflict types, etc. I guarentee that in my case the provided graph 100% will not have any crossing edges (will not have conflicts).
- I want the ability to hardcode the graph. e.g. I write an array like this one:
```js
var data = [
{ id: "1", parentIds: [] },
{ id: "2", parentIds: [] },
{ id: "3", parentIds: ["1"] },
{ id: "4", parentIds: ["2"] },
{ id: "5", parentIds: ["3", "4"] },
// .....
];
```
and construct a graph from it.
- I want the ability to hardcode the leyout. Do not write any leyout algorithm. I will decide each node level and position within the level manually.
- The internal graph structure should be a hashmap of parents (key - nodeid, value - array of parents) + hashmap of children (key - nodeid, value - array of children), layering (array of levels where lever is an array of nodes ids within the level).