-
Replaced/duplicate implementations
- [ ] New Link Cut Tree implementation (this submission from NWERC has a [short one](https://ideone.com/EhActz))
- [x] Another simplex implementation (they're not …
-
```
What steps will reproduce the problem?
1. run the program as normal
2. using a complete directed graph(just as the testing file test_17)
3. set the path number more than 3
What is the expected ou…
-
I have a conjecture that many-to-many relations are just a collection or set of the one-to-one and one-to-many relation times, but haven't been able to fully prove it/convince myself yet. Most promisi…
-
Not an issue, just a simple suggestion, could it be possible to introduce residual/skip connections in the form of extra directed arrows in the network graph? perhaps the skip connection could feed in…
-
There is an underspecified part of the spec regarding what constitutes a valid workflow. Here is what the spec says:
> A workflow is a process characterized by multiple subprocess steps, where step…
-
Hi,first of all, thanks very much that your code help me solving a big problem.
At the same time,I have some issue which bother me for a long time. the line 193 judge "L.vertex[w].d < L.vertex[w].f",…
-
The FHIR JSON schema contains many circular references, notably `Element` and `Extension`, which are fundamental building blocks for all FHIR resources but there are others, such as `Identifier` and `…
-
Hi,
Thank you for your great work on this package!
I am testing the behaviour of the PC algorithm on simple simulated data. I found that the number of directed edges detected differs based on the…
-
Hey, I am trying to run example code in your repo(sequences.txt) with some modifications in local system but I am having this problem.
```
$ python3 ./gengraphTool.py make_genome_graph --seq_file …
-
**Describe the bug**
Serializing a graph to GraphML, discards TaggedEdge data.
**To Reproduce**
Steps to reproduce the behavior:
1. Make a graph (I tested with BidirectionalGraph)
2. Use Tagged…