|
Size: 87
Comment:
|
Size: 1289
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| Describe graph database here. | [[TableOfContents]] |
| Line 3: | Line 3: |
| under construction. | == Introduction == |
| Line 5: | Line 5: |
| The SAGE Graph Theory Project aims to implement Graph objects and algorithms in ["SAGE"]. The goal of the Graph Database is to implement constructors for many common graphs, as well as thorough docstrings that can be used for educational purposes. Please check below for updates and note the section set aside for suggestions at the bottom of the page. Emily Kirkman is working on this project. == Basic Structures == We've begun to implement some basic graph constructors with (hopefully) intuitive graphics. Please browse below and for more information on graph plotting, look at Rober Miller's [http://sage.math.washington.edu:9001/graph_plotting wiki]. === Complete Graphs === The Complete Graph constructor takes an integer argument n, which is the number of vertices to be in the graph. The chosen convention is to display this graph in a cyclic manner with the first node at the top (via a position dictionary of [x,y] tuples). EXAMPLES: Here is a complete graph with n=16: attachment:complete_16.png Below, we used the SAGE !GraphicsArray to show 16 complete graphs at once, starting at n=3 and through n=18. |
|
| Line 6: | Line 22: |
== Named Graphs == === Petersen === == Suggestions == * ??? |
Introduction
The SAGE Graph Theory Project aims to implement Graph objects and algorithms in ["SAGE"].
The goal of the Graph Database is to implement constructors for many common graphs, as well as thorough docstrings that can be used for educational purposes. Please check below for updates and note the section set aside for suggestions at the bottom of the page.
Emily Kirkman is working on this project.
Basic Structures
We've begun to implement some basic graph constructors with (hopefully) intuitive graphics. Please browse below and for more information on graph plotting, look at Rober Miller's [http://sage.math.washington.edu:9001/graph_plotting wiki].
Complete Graphs
The Complete Graph constructor takes an integer argument n, which is the number of vertices to be in the graph. The chosen convention is to display this graph in a cyclic manner with the first node at the top (via a position dictionary of [x,y] tuples).
EXAMPLES: Here is a complete graph with n=16: attachment:complete_16.png Below, we used the SAGE GraphicsArray to show 16 complete graphs at once, starting at n=3 and through n=18. attachment:complete_array.png
Named Graphs
Petersen
Suggestions
- ???