-
It's currently possible to create an undirected graph by adding edges from both `u` to `v` and `v` to `u` for all connected pairs `(u, v)`. This requires a bit of extra space and more effort to set up…
wylee updated
3 weeks ago
-
### 🐛 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…
-
Problem name: Minimum Diameter Spanning Tree
Problem ID: minimum_diameter_spanning_tree
## Problem
Given a simple connected undirected graph with $n$ vertices and $m$ edges, find the spanning t…
-
var g = new jsgraphs.WeightedGraph(2);
g.addEdge(new jsgraphs.Edge(0, 1, 5.0));
var dijkstra = new jsgraphs.Dijkstra(g, 0);
var has0To1 = idijkstra.hasPathTo(1); // True.. a…
-
Looking at [issue 35](https://github.com/JuliaGraphs/GraphIO.jl/issues/35), it appears the tacit convention is to take the graph type as an argument. However EdgeList only creates directed graphs as c…
-
We should provide an undirected graph abstraction. At the moment the csr graph is directed.
For use what we have and turn it into an undirected graph, we'll need
- https://github.com/tinygraph/tin…
-
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…
-
# 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…
-
Hello author, I have 58 continuous variables, want to find the causal relationship between these variables, first I use the BOSS algorithm (using the default parameters), and set the level constraint …
-
Speculative thread on the possibility to make the graph undirected. It is at all possible?
Some notes and comments on this possibility:
- Edges should become undirected: no more distinction betwee…