|
Size: 1706
Comment:
|
Size: 1405
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 7: | Line 7: |
| * (done) Latex Graphs: Craig Citro & Robert Miller -- write an eps file to be included in LaTeX documents. | |
| Line 8: | Line 9: |
| * Expose these in SAGE: centrality, cliques, cluster, cores, search -- These are pretty standard graph theoretic programs, and should not take too long to wrap. | * (done) NetworkX 1: Expose these in SAGE: centrality, cliques, cluster, cores, search. |
| Line 10: | Line 11: |
| * 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 11: | Line 13: |
| * NetworkX: The following modules could be useful, and have not yet been wrapped: centrality, cliques, cluster, cores, hybrid, search, spectrum, threshold * spectrum -- This should probably not be wrapped, but instead mimicked, since sage's linear algebra is undoubtedly faster. * 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. * 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. |
* Graph Database: Update interface to sqlite database of all graphs with 8 or fewer vertices. |
| Line 20: | Line 17: |
| * 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. | * bipartite class |
| Line 22: | Line 19: |
| * (done) Latex Graphs: At sage days 3, Craig Citro gave Robert Miller a scheme program to plot graphs in postscript format. It would be great to get this working from python. | * 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? |
| Line 24: | Line 23: |
| * Graph Database: Update interface to sqlite database of all graphs with 8 or fewer vertices. | * 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.
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.
- Graph Database: Update interface to sqlite database of all graphs with 8 or fewer vertices.
[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.