-
Original ticket https://networkx.lanl.gov/trac/ticket/606
Reported 2011-07-23 by nick.mancuso, assigned to @hagberg.
I am unable to use the new bipartite functions on digraphs I know a priori to be b…
-
Original ticket https://networkx.lanl.gov/trac/ticket/689
Reported 2012-02-17 by @jtorrents, assigned to @hagberg.
Nicholas Dronen proposed this code on the mailing list (1) to add a function to buil…
-
Original ticket https://networkx.lanl.gov/trac/ticket/512
Reported 2011-02-26 by @hagberg, assigned to @hagberg.
Add bipartite clustering functions. Code attached.
References:
Matthieu Latapy, Clé…
-
Original ticket https://networkx.lanl.gov/trac/ticket/519
Reported 2011-03-11 by @jtorrents, assigned to @hagberg.
Another feature related to bipartite networks that I miss in NetworkX would be to in…
-
Original ticket https://networkx.lanl.gov/trac/ticket/528
Reported 2011-03-25 by @jtorrents, assigned to @hagberg.
Some centrality measures (degree_centrality, betweenness_centrality and closeness_ce…
-
Original ticket https://networkx.lanl.gov/trac/ticket/515
Reported 2011-03-07 by @jtorrents, assigned to @hagberg.
Add bipartite node redundancy. The redundancy coefficient of a node v is the fraction…
-
Original ticket https://networkx.lanl.gov/trac/ticket/552
Reported 2011-05-15 by trac user dheerajrav, assigned to @hagberg.
I just ran the nosetests on the most recent development version of network…
-
This triggers a bug:
```
sage: g = graphs.IcosahedralGraph()
sage: g.chromatic_number(algorithm='MILP')
```
The bug is in `graphs/graph_coloring.py`. In particular, this code is bogus:
```
…
-
In Sage 4.6, I see
```
sage: a=BipartiteGraph(matrix(2,2,[1,0,1,0]))
sage: a.show()
```
gives a graph where vertex "1" is not labeled (see attached picture).
Component: **graph theory**
Author:…
-
Only 4 methods to go, and this patches give 100% of doctest coverage for the graph/ folder !
Nathann
CC: @rlmill
Component: **documentation**
Author: **Nathann Cohen, Robert Miller**
Reviewer:…