-
I was curious how you can use Hungarian algorithm for complete (not bipartite) graphs.
But the perfect matching that is the result of `min_Munkres` doesn't always return the best answer. For this t…
-
In #24924 bliss was enabled for computing automorphisms of edge-coloured graphs. The latter is used for `automorphisms_of_rows_and_columns()` of matrices. For the following matrix `j`, with bliss in…
-
I have a DiGraph with isolated vertices and I want to turn it into a BipartiteGraph. It seems that the isolated vertices will be assigned to left no matter what I do.
```
sage: d = DiGraph(6); d.ve…
-
This property should be in gt.sage.
Its defined:
https://www.sciencedirect.com/science/article/pii/S0095895699919160
-
After installing Gurobi 8.0, `make ptestlong` gives:
```
----------------------------------------------------------------------
sage -t --long --warn-long 78.4 src/sage/graphs/generic_graph.py # 7…
-
- create a standard input format : look at shinemas2R::is.get.data.output.R and appendix D of the vignette of shinemas2R
- reformat code from shinemas2R functions
- shinemas2R::get.ggp…
-
Addition of a method spqr_tree() to generic_graph.py to decompose a 2-vertex-connected graph into cycles, cocycles, and 3-vertex-connected blocks.
CC: @dcoudert @meghanamreddy @sagetrac-saiharsh
…
-
It's all in the title: if you need a quick way to support `network::network`, the `intergraph` can handle that. Supports both uni- and bipartite graphs if memory serves.
P.S. Your work on `ggraph` …
-
Loops should not be allowed in a bipartite graph, but we can currently do:
```
sage: B = BipartiteGraph(loops=True, multiedges=True)
sage: B.add_edge(0, 0)
sage: B.is_bipartite()
False
sage: B.add_…
-
Upon trying to pip install Networkx I get the following error message... 'error: could not create '/System/Library/Frameworks/Python.framework/Versions/2.7/share': Operation not permitted'
See full …