-
Given an undirected algorithm with nodes 0 and 1, with an edge from 0 to 1, it works fine.
But when the edge is from 1 to 0 it says the graph is not bipartite, we tested this in GraphTea as well
and…
-
### 📚 Describe the documentation issue
Hi,
This line:
https://github.com/pyg-team/pytorch_geometric/blob/master/torch_geometric/nn/conv/gatv2_conv.py#L230
Is there any way to add self-loops on…
-
Currently we can search based on bipartitions but there's no obvious way to pass a bipartition to and from the commandline, this is because a bipartition is handled as two sets of taxa. They don't hav…
-
You can construct a bipartite graph where both sides are the people involved in gift giving, remove all the restriction edges, and run an algorithm (either import it or write it yourself) to find the …
-
## ❓ Questions & Help
Hi, Thank you for your hard work.
My code looks like this
```python
class GCMCLayer(MessagePassing):
def __init__(self, in_channel1, in_channel2):
super(GCMCLayer,…
-
## ❓ Questions & Help
hey @rusty1s , I'm looking to have message updates for a bipartite graph, where each node set has a different update rule. Is that possible? I was looking around at the Mess…
-
Netwulf seems to have a problem with some node attributes. It results in not plotting anything.
I have a network that is a monopartite projection of a bipartite network. Therefore every node has th…
-
MKLau updated
10 years ago
-
When called with a two-mode adjacency matrix, `as.network.matrix` will correctly interpret this as a graph with an enforced bipartition, with the passed matrix being the off-diagonal portion of the fu…
-
Hi,
Can you please elaborate on this error?
Thanks in advance,
Boaz