Differences between revisions 95 and 101 (spanning 6 versions)
Revision 95 as of 2006-11-13 09:54:24
Size: 1906
Editor: anonymous
Comment:
Revision 101 as of 2007-02-16 04:14:05
Size: 2711
Editor: anonymous
Comment:
Deletions are marked like this. Additions are marked like this.
Line 3: Line 3:
==  Introduction ==

Th
e 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 (SAGE Days 3 project).
 * Graph plotting has been implemented:
attachment:9cube.png
Line 12: Line 12:
 * The initial [http://sage.math.washington.edu:9001/graph_benchmark benchmarking] has begun.
 * On Friday, October 20th Robert Miller 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.
 * Emily Kirkman has begun working on a database of common graphs.
 * The initial [http://sage.math.washington.edu:9001/graph_benchmark benchmarking] has proven that ["NetworkX"] is the solution for SAGE.
 * On Friday, October 20th, Robert Miller 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.
 * Emily Kirkman (and soon Jason Grout (Brigham Young)) is working on a database of well-known graphs.
 * Robert Miller has wrapped the basic functionality of NetworkX into SAGE's Graph class, and implemented plotting of graphs.
 * Jim Morrow has expressed interest in using SAGE for his summer REU on graphs. Robert Miller is currently working on implementing some of the algorithms of this group.
 * 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.
Line 17: Line 19:
Line 32: Line 33:
 * Need: Feedback! === Survey of Existing Database Software ===
 * [http://sage.math.washington.edu:9001/graph_db_survey Link]
 * I've found some resources, but please recommend...

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 (SAGE Days 3 project).
  • Graph plotting has been implemented:

attachment:9cube.png

  • We are currently seeking possible additions to our [http://sage.math.washington.edu:9001/graph_survey survey] of existing graph theory software.

  • The initial [http://sage.math.washington.edu:9001/graph_benchmark benchmarking] has proven that ["NetworkX"] is the solution for SAGE.

  • On Friday, October 20th, Robert Miller 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.

  • Emily Kirkman (and soon Jason Grout (Brigham Young)) is working on a database of well-known graphs.
  • Robert Miller has wrapped the basic functionality of NetworkX into SAGE's Graph class, and implemented plotting of graphs.
  • Jim Morrow has expressed interest in using SAGE for his summer REU on graphs. Robert Miller is currently working on implementing some of the algorithms of this group.
  • 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.

Wiki Pages

Survey of Existing Software

Benchmarks

  • [http://sage.math.washington.edu:9001/graph_benchmark Link]

  • Our initial tests are designed to compare the constructions and very basic functionality found in our survey of existing software. At this stage in the game, we are testing to find the best way to represent graph objects in SAGE.
  • We will post results on the wiki as we get them. And as always, we love feedback!

Plotting

Database

Survey of Existing Database Software

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