|
Size: 1158
Comment:
|
Size: 1478
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 18: | Line 18: |
| * [http://sage.math.washington.edu:9001/graph_survey link] | * [http://sage.math.washington.edu:9001/graph_survey Link] |
| Line 21: | Line 21: |
| * [http://sage.math.washington.edu:9001/graph_benchmark link] | * [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 construct graph objects in SAGE. * We will post results on the wiki as we get them. And as always, we love feedback! |
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.
Current Status
- 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...
Wiki Pages
Survey of Existing Software
- We have attempted to make a complete list of existing graph theory software. We posted functionality lists and some algorithm/construction summaries. We are very interested in feedback or last-minute additions, as we are ready to begin benchmarking our findings.
Initial Benchmark Results
- 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 construct graph objects in SAGE.
- We will post results on the wiki as we get them. And as always, we love feedback!