Differences between revisions 1 and 2
 ⇤ ← Revision 1 as of 2006-10-14 05:10:07 → Size: 48 Editor: D-128-208-62-108 Comment: ← Revision 2 as of 2006-10-14 05:45:28 → ⇥ Size: 905 Editor: D-128-208-62-108 Comment: Deletions are marked like this. Additions are marked like this. Line 1: Line 1: Describe graph benchmark here. [[TableOfContents]] Line 3: Line 3: Coming soon! == 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.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 initial benchmarks listed below, we will be comparing MAGMA, Mathematica (with Combinatorica), Maple, NetworkX, GRAPE, and nauty.We will post results here as we get them. And as always, we love feedback!== Initial Benchmarks ===== Generic Constructor ====== Edge Storage ====== Specific Constructors ====== Basic Storage Speed ====== Basic Algorithms ===

## 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.

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 initial benchmarks listed below, we will be comparing MAGMA, Mathematica (with Combinatorica), Maple, NetworkX, GRAPE, and nauty.

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

## Initial Benchmarks

### Basic Algorithms

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