-
### Description
This is a failure of aggregation fuzzer test, but the error message doesn't suggest there is unmatched result. We need to investigate into the error to tell whether it is a bug in the…
-
https://oi-wiki.org/graph/bi-graph/
-
Hey guys 👋 , @BillWagner @alexbuckgit @tdykstra @StephenCleary @stephentoub
Thanks for your article, was very helpful and easy to read. However, I have a question, per your **Caution** tip, which l…
-
The `__eq__` function in the DFA class uses the symmetric difference between both DFAs, which is an O(n^2) time algorithm (and requires creating an auxiliary DFA). The Hopcroft-Karp algorithm doesn't …
-
https://github.com/lrvideckis/programming_team_code/blob/1c0aecd498649beaf82e2727cb6615eaf84bb030/content/graphs/bipartiteMatcher.h
-
MinimizeOperations.minimizeHopcroft() creates a lot of objects because of strange arrays and useless ArrayLists with fixed length. E.g. it created List<List. This patch minimizes this and makes the…
-
### Relevant telegraf.conf
```toml
[[inputs.ethtool]]
interface_include = ["enp7s0"]
```
### Logs from Telegraf
```text
(After ~90 days of gradually increasing open files.)
2023-03…
-
Not sure what's up w/ this... if you check out the blocktree branch (#4104) and comment out the `@Ignore` in TestTermsEnum2.testFiniteVersusInfinite then this should hit OOME: {[ant test-core -Dtestca…
-
In current trunk, we let caller (e.g. RegExpQuery) try to "reduce" the expression. The parser nor the low-level executors don't implicitly call exponential-time algorithms anymore.
But now that we ha…
-
## 참고: 2020년에 쓴 알고리즘
1. Tree
* [x] LCA - 최문기
* [x] Segment Tree - **김정현** (실행 시간 보기)
* [x] Segment tree with lazy propagation - **김정현**
* [x] Persistent Segment Tree -> 작년꺼 그대로
…