-
**What is the feature or improvement you would like to see?**
Currently there is `igraph_get_adjacency(_sparse)()` to construct the adjacency matrix of a graph. There is also `igraph_get_incidence(…
-
On Julia 1.9.2 with GraphsMatching 0.2.0, the code from the introductory example does not run:
```
julia> using Graphs, GraphsMatching
julia> g = complete_graph(3)
julia> w = zeros(3,3)
julia> w[…
-
https://github.com/pyro-ppl/pyro/security/dependabot/1
> To resolve the issue add a supported lockfile (Pipfile.lock, pyproject.lock or poetry.lock).
> fritz: oh man we're using an old setuptool…
-
**Why this Mod?**
Graph problems are always nice and the picture for the gallery is already clear :)
The problem is easy to understand and well-known.
**What will the API be?**
It can be don…
-
A TransversalMatroid class that is a child of BasisExchangeMatroid, using a bipartite graph for data.
Depends on #23139
Depends on #25065
CC: @sagetrac-Stefan @sagetrac-Rudi @sagetrac-yomcat @sag…
-
This will allow users to make transversal matroids from the constructor by using a bipartite graph as input. It will also add transversals to advanced.py and make other improvements to that file.
D…
-
Will never be used in practice with `GreedyColoringAlgorithm`, but one could imagine optimal colorings with JuMP, which would only output a vector of colors.
#71 contains a `LinearSystemColoringRes…
-
I was looking at this, because I wanted to convert it to Julia v1.0, but I'm not sure this function actually does what it should do.
From my understanding, it tries to solve the following (simplified…
-
A clique tree is a tree over the maximal cliques where all pairs of maximal cliques satisfy the clique intersection property.
Considering the output of junction tree for this graph, the node of the…
-
Generally speaking, creating a specific graph subtype struct (e.g. a directed graph or a bipartite graph) can be implemented by imposing constraints on a generic graph go struct. Upon every node inser…