-
Blank node graphs are a neat trick. For example:
```turtle
_:b0 {
.
}
```
When having parsed the page containing the data, we can be certain we got all triples possible within `_:b0`, as t…
-
Olaf Hartig provided a [formalization](https://lists.w3.org/Archives/Public/public-rdf-star-wg/2023Nov/0027.html) as a means to better understand NNG. His formalization is very succinct and provides a…
-
Not really a feature request per se, but came across this project after it was mentioned in another issue ([Ref](https://github.com/princeton-nlp/SWE-agent/issues/38#issuecomment-2037412677)), and fig…
-
Hi all! Still getting used to the graphblas bindings and writing efficient enough algorithms to contribute effectively, but I thought I'd put a placeholder issue up in case someone else already has pr…
-
## Feature Request
Not sure if this is a feature request or just a comment / question on how I'm using graaf or how should I use it.
I'm not a super expert on C++20, so the code it's not easy to rea…
-
From in-person meeting with Denis, Jenn, Mike, Sharron, and Shawn on 15 October 2024.
Agreed on:
- for the resource on the WAI website, focus on the provided mappings that most people will use (ra…
-
## Implementing Prim's Minimum Spanning Tree Algorithm in C++
Please read the contributing guidelines in [CONTRIBUTING.md](https://github.com/deutranium/Algorithms/blob/master/CONTRIBUTING.md)
L…
-
It looks like inference is not working for non-tree structures.
For example consider the following simple factor graph with nodes x1, x2, x3 and factors fa, fb, fc.
```python
from fglib import grap…
-
-
To capture steps performed in working up data. ETL logic.
Working here: https://github.com/iodepo/odis-in/tree/master/dataGraphs/thematics/provenance/graphs