|
Size: 1728
Comment:
|
Size: 2053
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 7: | Line 7: |
| Cayley Graph of $A_5$ == BEFORE == |
|
| Line 8: | Line 10: |
| * Expose these in SAGE: centrality, cliques, cluster, cores, search -- These are pretty standard graph theoretic programs, and should not take too long to wrap. | == AFTER == |
| Line 10: | Line 12: |
| * (done) Latex Graphs: Craig Citro & Robert Miller -- write an eps file to be included in LaTeX documents. | |
| Line 11: | Line 14: |
| * 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. |
* (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 16: | Line 17: |
| * 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. | * [http://sage.math.washington.edu/home/rlmill/wshlst.pdf Wishlist] from Chris Godsil. Most feasible first. |
| Line 18: | Line 19: |
| * [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. | * (done) graph isomorphism and automorphism, graph6 and sparse6 formatting, database of small graphs, eigenvalues and eigenspaces, characteristic and minimal polynomials |
| Line 20: | Line 21: |
| * 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. | * (easy) cayley graphs, edge colorings, bipartite graphs, point graph, line graph, graph from set and binary function, vertices as vector subspaces, generating trees |
| Line 22: | Line 23: |
| * (done) Latex Graphs: At sage days 3, Craig Citro gave Robert Miller a scheme program to plot graphs in postscript format. This is now working from Python, needs only be cleaned up and submitted. | * (medium) certain types of curves for plotting edges, generator based on geng * (tedium) databases: ted spence, gordon royle * (hard) max indep. set, chromatic number, hamilton cycles and paths, chromatic polynomial, tutte polynomial, cut vertices, vertex/edge connectivity, planarity |
| Line 25: | Line 30: |
| * Emily Kirkman is currently working on this. * 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. * 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? |
Graph Theory
[:days4/projects/: Other SAGE Days 4 Project]
Participants: Emily Kirkman, Robert Miller, Craig Citro and David Roe
Cayley Graph of A_5
BEFORE
AFTER
(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).
[http://sage.math.washington.edu/home/rlmill/wshlst.pdf Wishlist] from Chris Godsil. Most feasible first.
- (done) graph isomorphism and automorphism, graph6 and sparse6 formatting, database of small graphs, eigenvalues and eigenspaces, characteristic and minimal polynomials
- (easy) cayley graphs, edge colorings, bipartite graphs, point graph, line graph, graph from set and binary function, vertices as vector subspaces, generating trees
- (medium) certain types of curves for plotting edges, generator based on geng
- (tedium) databases: ted spence, gordon royle
- (hard) max indep. set, chromatic number, hamilton cycles and paths, chromatic polynomial, tutte polynomial, cut vertices, vertex/edge connectivity, planarity
- Graph Database: Update interface to sqlite database of all graphs with 8 or fewer vertices.
- Emily Kirkman is currently working on this.
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.
- 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?