Differences between revisions 82 and 116 (spanning 34 versions)
⇤ ← Revision 82 as of 2006-10-14 05:23:01 →
Size: 893
Editor: anonymous
Comment:
← Revision 116 as of 2007-04-17 23:56:12 → ⇥
Size: 3219
Editor: anonymous
Comment:
Deletions are marked like this. Additions are marked like this.
Line 3: Line 3:
==  Introduction ==

The SAGE Graph Theory Project aims to implement Graph objects and algorithms in ["SAGE"].

The main people working on this project are Emily Kirkman, Robert Miller and Bobby Moretti.		 == Introduction ==
 . We are implementing graph objects and algorithms in ["SAGE"]. The main people working on this project are Emily Kirkman and Robert Miller.
Line 10: Line 7:
 * 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, including perhaps an open source version of nauty. Robert is working to fulfill his wish list.
 * Graph plotting has been implemented in two dimensions:
Line 11: Line 13:
 * We are currently seeking feedback on our survey of existing graph theory software.
 * We hope to begin the initial benchmarks this week. These will deal mostly with construction, retrieval and basic algorithms.
 * On Friday, October 20th Robert Miller will be giving a talk in PDL C-401 on graph theory and optimal algorithms. The talk is at 4? 5? Somebody that knows the correct time should put it in...		 {{{
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])
}}}
Line 15: Line 24:
== Wiki Pages == attachment:9_cube.png
Line 17: Line 26:
=== Survey of Existing Software ===
   [http://sage.math.washington.edu:9001/graph_survey link]
==== Initial Benchmark Results ====
   [http://sage.math.washington.edu:9001/graph_benchmark link]		 == 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 Mar. 2, 2007, in B027 at 10:30 a.m., Robert Miller will give a talk entitled "Opening Graph Automorphisms". The abstract is located [http://sage.math.washington.edu:9001/sage-uw here].

== Other wiki pages ==
 * Surveys
  . [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.

 * [http://www.sagemath.org:9001/graph_benchmark Benchmarks]
  . Initial Benchmarks indicated that NetworkX was the appropriate package for inclusion in SAGE. They were designed to compare the constructions and very basic functionality found in our survey of existing software.

 * [http://www.sagemath.org:9001/graph_plotting Plotting]
  * 2D plotting is implemented using matplotlib.
  * 3D plotting via Tachyon is coming soon.
  * 3D interactive viewing is on its way, via Java applets (pending some serious implementation issues).

 * [http://www.sagemath.org:9001/graph_generators Graph Generators]
  * So far: Basic graph structures with intuitive graphics.
  * Extensive educational docstrings and many graph constructors.
  * Native positionings allow standard layouts and quicker plotting

 * [http://www.sagemath.org:9001/graph_database Database]
  . Emily has provided a provisional database of graphs on up to seven vertices:

{{{
graphs_query.show_graphs(with_properties=True, nodes=7, diameter=5)
}}}
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, including perhaps an open source version of nauty. Robert is working to fulfill his wish list.
  • 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

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)