Differences between revisions 103 and 120 (spanning 17 versions)
Revision 103 as of 2007-02-16 04:55:03
Size: 3071
Editor: anonymous
Comment:
Revision 120 as of 2007-05-01 22:57:44
Size: 3616
Editor: anonymous
Comment:
Deletions are marked like this. Additions are marked like this.
Line 7: Line 7:
 * NetworkX base classes have been interfaced, and all functions are soon to follow (SAGE Days 3 project).  * NetworkX base classes have been interfaced, and all functions are soon to follow.
Line 10: Line 10:
 * Chris Godsil (Waterloo) has expressed interest in helping design a more general discrete math package in SAGE, including perhaps an open source version of nauty. Robert is working to fulfill his wish list.  * Chris Godsil (Waterloo) has expressed interest in helping design a more general discrete math package in SAGE.
 * Brendan McKay's isomorphism algorithm has been replicated for the open source community (it is called "nice"
, as opposed to "nauty").
Line 29: Line 30:
 * On Feb. 17, 2007, Robert gave a [http://www.robertlmiller.com/talks/graph_intro.pdf talk] at Sage Days 3.
 * On Mar. 2, 2007, Robert gave a talk entitled "Opening Graph Automorphisms".
 * On Mar. 29, 2007, he followed up with a [http://www.robertlmiller.com/talks/nauty.pdf part two] of this talk, after implementing "nice".
 * On Apr. 21, 2007, Emily presented a poster introducing the SAGE graph theory package at East Coast Computer Algebra Day.
 * On Apr. 27, 2007, Emily gave a talk introducing the (almost complete) sqlite database.
Line 32: Line 38:
  . [http://sage.math.washington.edu:9001/graph_survey Existing Software]: We are always seeking additions and comments.
  . [http://sage.math.washington.edu:9001/graph_db_survey Existing Databases]: Includes comments by Jason Grout.
  . [http://www.sagemath.org:9001/graph_survey Existing Software]: We are always seeking additions and comments.
  . [http://www.sagemath.org:9001/graph_db_survey Existing Databases]: Includes comments by Jason Grout.
Line 35: Line 41:
 * [http://sage.math.washington.edu:9001/graph_benchmark Benchmarks]  * [http://www.sagemath.org:9001/graph_benchmark Benchmarks]
Line 38: Line 44:
 * [http://sage.math.washington.edu:9001/graph_plotting Plotting]  * [http://www.sagemath.org:9001/graph_plotting Plotting]
Line 43: Line 49:
 * [http://sage.math.washington.edu:9001/graph_generators Graph Generators]  * [http://www.sagemath.org:9001/graph_generators Graph Generators]
Line 48: Line 54:
 * [http://sage.math.washington.edu:9001/graph_database Database]  * [http://www.sagemath.org:9001/graph_database Database]
Line 54: Line 60:
attachment:database.png

TableOfContents

Introduction

  • We are implementing graph objects and algorithms in ["SAGE"]. The main people working on this project are Emily Kirkman and Robert Miller.

Current Status

  • NetworkX base classes have been interfaced, and all functions are soon to follow.
  • Jason Grout's (Brigham Young) SQL lite graph database is almost finished, and when it is done, it will be interfaced by Emily.
  • Jim Morrow (UW) has expressed interest in using SAGE for his [http://www.math.washington.edu/~morrow/reu07/reu.html summer REU] on graphs. Robert is working on implementing electrical networks, which includes implementing edge weights and graphs with boundary.

  • Chris Godsil (Waterloo) has expressed interest in helping design a more general discrete math package in SAGE.
  • Brendan McKay's isomorphism algorithm has been replicated for the open source community (it is called "nice", as opposed to "nauty").

  • Graph plotting has been implemented in two dimensions:

C = graphs.CubeGraph(9)
color = {}
for v in C.vertices():
    b = v.count('1')/9
    g = 1 - b
    if color.has_key((0, g, b)): color[(0, g, b)].append(v)
    else: color[(0, g, b)] = [v]
C.show(vertex_labels=False, node_size=60, graph_border=True, color_dict=color, figsize=[9,8])

attachment:9_cube.png

Talks

  • On Oct. 20, 2006, Robert gave a [http://sage.math.washington.edu/home/rlmill/talk_2001-10-20/2006-10-20SAGE.pdf talk] about the state of affairs for existing software which shared a few benchmarks and discussed some implementation ideas.

  • On Feb. 15, 2007, Robert and Emily gave an Informal Introduction to the Graph Theory Package. This talk was essentially a review of newly available features.
  • On Feb. 17, 2007, Robert gave a [http://www.robertlmiller.com/talks/graph_intro.pdf talk] at Sage Days 3.

  • On Mar. 2, 2007, Robert gave a talk entitled "Opening Graph Automorphisms".
  • On Mar. 29, 2007, he followed up with a [http://www.robertlmiller.com/talks/nauty.pdf part two] of this talk, after implementing "nice".

  • On Apr. 21, 2007, Emily presented a poster introducing the SAGE graph theory package at East Coast Computer Algebra Day.
  • On Apr. 27, 2007, Emily gave a talk introducing the (almost complete) sqlite database.

Other wiki pages

graphs_query.show_graphs(with_properties=True, nodes=7, diameter=5)

attachment:database.png

graph (last edited 2009-11-29 06:48:46 by newacct)