Differences between revisions 8 and 9
 ⇤ ← Revision 8 as of 2006-10-14 17:05:38 → Size: 1329 Editor: 67-40-201-78 Comment: ← Revision 9 as of 2006-10-14 17:06:29 → ⇥ Size: 1343 Editor: 67-40-201-78 Comment: Deletions are marked like this. Additions are marked like this. Line 18: Line 18: * Fill in and then delete all edges one by one (directed and undirected, sparse and dense) * Fill in and then delete all edges one by one (directed and undirected, sparse and dense, if supported)

## Introduction

The SAGE [http://sage.math.washington.edu:9001/graph 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.

We will post results here as we get them. And as always, we love feedback!

## Initial Benchmarks

• Our initial tests are designed to compare the constructions and very basic functionality found in our [http://sage.math.washington.edu:9001/graph_survey survey of existing software]. At this stage in the game, we are testing to find the best way to construct graph objects in ["SAGE"]. For the first round of benchmarking, we will be comparing MAGMA, Mathematica (with Combinatorica), Maple, NetworkX, GRAPE, and nauty.

### Generic Constructor

• Create a graph with n nodes and no edges (sparse and dense, if supported)

### Edge Storage

• Fill in and then delete all edges one by one (directed and undirected, sparse and dense, if supported)

### Specific Constructors

• Create a complete graph on n nodes
• Create a complete bipartite graph on n nodes
• Create a cycle on n nodes

### Basic Algorithms

• From a given database of graphs, we will compute
• Connectivity
• Diameter
• Girth
• Chromatic number

graph_benchmark (last edited 2008-11-14 13:41:59 by localhost)