-
# colour:
Currently, the adjacency graphs assume the nodes of the graph are all the same 'colour' or type. This has implications for the size and memory layout of the graphs. However, if one allow…
-
This issue tracks the goal of writing a PoC implementation of the loop finding according to https://github.com/ledgerloops/ledgerloops.com/issues/92
As a PoC, it *will* require all code to run with…
-
### 🐛 Describe the bug
I am working on a task in which I have two types of nodes and the edges are only `association`, so it is considered a bipartite graph. I want this graph to be undirected so t…
-
To properly enable calculation of hierarchy and direction of the river network small and large cycles needs to be resolved and "broken".
-
Hi:
Thank you for your great work!
Now I'm trying to run your code on a unfeatured, undirected graph with a feature vector generated from Deepwalk. But the performance is really poor. I'm wonder…
-
```
Try to create a graph that for each accessed vertex, a parallel thread reads
the neighbor edges and "touches" the opposite vertices so that it is already in
cache in case it needs to be accessed…
-
The [edges()](https://docs.rs/petgraph/0.5.0/petgraph/graph/struct.Graph.html?search=#method.edges) method of Graph returns all outgoing edges of a node if the graph uses Directed edges. How to get al…
-
Hi, thanks for awesome graphlib.
Correct me if I'm wrong. `findCycles` algorithm does not support undirected graphs. Any plans to add this?
dbtek updated
5 years ago
-
-
Hello,
Is there a way to represent directed graphs? The links have a Source/Target, but the edge target does not have a symbol indicating the direction, also if we have a bi-directional relationshi…