(long id, V value)
| 35 | final DirectedAcyclicGraph<BDAGNodeKey, DefaultEdge> graph = new DirectedAcyclicGraph<>(DefaultEdge.class); |
| 36 | |
| 37 | public void addNode(long id, V value) throws Exception { |
| 38 | // var nodeIdKey = new BDAGNodeKey(name, Long.toString(id)); |
| 39 | var nodeNode = new BDAGNode(); |
| 40 | nodeNode.getValue().setBean(value); |
| 41 | checkValid(); |
| 42 | } |
| 43 | |
| 44 | public void addEdge(long from, long to) throws Exception { |
| 45 | checkValid(); |
nothing calls this directly
no test coverage detected