-
This patch allows a BipartiteGraph to be created from a reduced adjacency matrix and return the same. Multi-edge or weighted constructions are supported. Also, it adds support for creation, loadin…
-
This is just an implementation of the barebones minimum. The patch also includes some documentation cleanup.
CC: @roed314
Component: **graph theory**
_Issue created by migration from https://tra…
-
The following pops up after merging #2473:
```
sage -t -long devel/sage-main/sage/graphs/graph_generators.py
**********************************************************************
File "graph_gene…
-
There is a bug in the NetworkX function is_bipartite, which sometimes gives False positives. Due to this, a few examples in graph_generators.py give possibly bad output. I have labeled them with # r…
-
BipartiteGraph.__init__ does not call the base class `__init__` for some inputs, leaving the object unusable. For example,
```
sage: B = BipartiteGraph(None)
sage: B
```
will throw an exception b…
-
From Chris Godsil's wishlist (reply by Jason Grout, second reply by Robert Miller)
```
>>> (e) Bundles: Start with a base graph G with vertices {1, . . . , n}.
>>> For each
>>> vertex i we are give…
-
Here are a few functions wrapped from the bipartite functions in networkx.
Component: **combinatorics**
_Issue created by migration from https://trac.sagemath.org/ticket/869_