|
Size: 1503
Comment:
|
Size: 1570
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 9: | Line 9: |
| * NetworkX 1: Expose these in SAGE: centrality, cliques, cluster, cores, search -- These are pretty standard graph theoretic programs, and should not take too long to wrap. * NICE: The nauty clone for computing automorphism groups of graphs, and computing isomorphism. It has been converted to Pyrex, but it could still stand much optimization. * Electrical Networks, Jim Morrow's REU: Graphs with boundary are already in sage, but there are probably some useful constructions for Jim's summer REU that are not implemented yet. Especially data structures, perhaps an !ElectricalNetworks class. Look at the Dirichlet problem and (circular) planar embeddings of graphs. |
* (done) NetworkX 1: Expose these in SAGE: centrality, cliques, cluster, cores, search. * Also note significant updates to Generators class from wrapping NetworkX, (see the [http://www.sagemath.org/9001:graph_generators wiki] for pretty pictures). |
| Line 17: | Line 14: |
| * Electrical Networks, Jim Morrow's REU: Graphs with boundary are already in sage, but there are probably some useful constructions for Jim's summer REU that are not implemented yet. Especially data structures, perhaps an !ElectricalNetworks class. Look at the Dirichlet problem, graphs on surfaces and (circular) planar embeddings of graphs. |
|
| Line 18: | Line 17: |
* bipartite class |
|
| Line 21: | Line 22: |
| * hybrid, threshold -- These seem to be specialized programs that are closely related to the research areas of the NetworkX authors. It is unclear what to do with these. | * hybrid, threshold -- Figure out what these are? * NICE: The nauty clone for computing automorphism groups of graphs, and computing isomorphism. It has been converted to Pyrex, but it could still stand much optimization. Tabled, since Leon's programs will likely beat it out in spades. |
Graph Theory
[:days4/projects/: Other SAGE Days 4 Project]
Participants: Emily Kirkman, Robert Miller, Craig Citro and David Roe
(done) Latex Graphs: Craig Citro & Robert Miller -- write an eps file to be included in LaTeX documents.
- (done) NetworkX 1: Expose these in SAGE: centrality, cliques, cluster, cores, search.
Also note significant updates to Generators class from wrapping NetworkX, (see the [http://www.sagemath.org/9001:graph_generators wiki] for pretty pictures).
- Graph Database: Update interface to sqlite database of all graphs with 8 or fewer vertices.
Electrical Networks, Jim Morrow's REU: Graphs with boundary are already in sage, but there are probably some useful constructions for Jim's summer REU that are not implemented yet. Especially data structures, perhaps an ElectricalNetworks class. Look at the Dirichlet problem, graphs on surfaces and (circular) planar embeddings of graphs.
[http://sage.math.washington.edu/home/rlmill/wshlst.pdf Wishlist] from Chris Godsil: It would be great if we could complete the list this week.
- bipartite class
- NetworkX 2:
- spectrum -- This should probably not be wrapped, but instead mimicked, since sage's linear algebra is undoubtedly faster.
- hybrid, threshold -- Figure out what these are?
- NICE: The nauty clone for computing automorphism groups of graphs, and computing isomorphism. It has been converted to Pyrex, but it could still stand much optimization. Tabled, since Leon's programs will likely beat it out in spades.