| #14525 |
cliquer does not like the empty graph
|
new
|
jason, ncohen, rlm
|
defect
|
critical
|
sage-5.10
|
| #1047 |
graphs: Create the "visitor" concept in Boost
|
new
|
was
|
enhancement
|
major
|
sage-wishlist
|
| #1048 |
graphs: Create filtered views of graphs
|
new
|
was
|
enhancement
|
major
|
sage-wishlist
|
| #1307 |
graphs: Strongly regular graph database
|
new
|
rlm
|
enhancement
|
major
|
sage-wishlist
|
| #1308 |
graphs: Gordon Royle's graph data in a database
|
new
|
rlm
|
enhancement
|
major
|
sage-wishlist
|
| #1312 |
graphs: find hamiltonian cycles and paths
|
new
|
rlm
|
enhancement
|
major
|
sage-5.10
|
| #1314 |
graphs: calculate tutte polynomial
|
new
|
rlm
|
enhancement
|
major
|
sage-wishlist
|
| #1928 |
Bundles of graphs
|
new
|
rlm
|
enhancement
|
major
|
sage-wishlist
|
| #1941 |
Finish bipartite graph implementation
|
new
|
rlm
|
defect
|
major
|
sage-5.10
|
| #2378 |
graph and digraph animations
|
new
|
jason
|
enhancement
|
major
|
sage-wishlist
|
| #2686 |
graph generators - new additions
|
new
|
rlm
|
enhancement
|
major
|
sage-5.10
|
| #2817 |
specify options for parts of graphs
|
new
|
jason
|
enhancement
|
major
|
sage-wishlist
|
| #4508 |
Update John Boyer's planarity code to the BSD version
|
new
|
mabshoff
|
enhancement
|
major
|
sage-5.10
|
| #4754 |
Merge minimum rank code
|
needs_work
|
jason
|
enhancement
|
major
|
sage-5.10
|
| #4854 |
represent paths as lists of edges
|
needs_info
|
rlm
|
enhancement
|
major
|
sage-5.10
|
| #6074 |
Planar graph generation
|
new
|
rlm
|
enhancement
|
major
|
sage-wishlist
|
| #6236 |
find the dual graph of a planar graph
|
new
|
rlm
|
enhancement
|
major
|
|
| #6527 |
finish implementing set_circular_planar for graphs
|
new
|
ekirkman
|
defect
|
major
|
|
| #6604 |
Polish the use of iterators in C graphs
|
new
|
rlm
|
enhancement
|
major
|
sage-5.10
|
| #7302 |
Nowhere zero flow
|
needs_work
|
rlm
|
enhancement
|
major
|
sage-5.10
|
| #7303 |
Nash-William theorem on orientation of graph
|
needs_work
|
rlm
|
enhancement
|
major
|
sage-wishlist
|
| #7304 |
Contract edge in graph
|
needs_info
|
rlm
|
enhancement
|
major
|
sage-5.10
|
| #7675 |
shortest_path in c_graph should have an optional flag distance=False to return only the distance
|
needs_work
|
rlm
|
enhancement
|
major
|
sage-5.10
|
| #7676 |
shortest_path_all pairs in Cython through Floyd Warshall
|
needs_work
|
rlm
|
enhancement
|
major
|
sage-5.10
|
| #7720 |
Digraph.reverse() should be rewritten more efficiently ( not hard )
|
needs_work
|
rlm
|
enhancement
|
major
|
sage-5.10
|
| #8031 |
make graph_editor also available as a *method* on graphs
|
new
|
rlm
|
enhancement
|
major
|
sage-5.10
|
| #8145 |
Joe Culberson's graph programs
|
needs_info
|
rlm
|
enhancement
|
major
|
sage-wishlist
|
| #8222 |
sagenb -- misc improvements to the notebook graph editor
|
needs_work
|
rlm
|
enhancement
|
major
|
sage-5.10
|
| #8372 |
split up incidence_matrix() over graph.py and digraph.py
|
needs_work
|
rlm
|
enhancement
|
major
|
sage-5.10
|
| #8714 |
add Bellman-Ford algorithm for shortest paths
|
needs_work
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #8744 |
Improve add_edge in BipartiteGraph to make it independent from the current coloring
|
new
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #8932 |
Shortest circuit in digraphs
|
needs_work
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #9060 |
break symmetries in subgraph search
|
needs_work
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #9136 |
more named graphs
|
new
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-wishlist
|
| #9143 |
Speed up graph generation using Cython
|
new
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #9157 |
(k-cores) Improvement to subgraph search
|
needs_work
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #9158 |
(modular decomposition) Improvement to subgraph search
|
needs_work
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #9159 |
(modular decomposition) Improvement to graph coloring
|
needs_work
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #9529 |
in graph_plot.py, sometimes get "libpng error: Image width or height is zero in IHDR"
|
new
|
jason, ncohen, rlm
|
defect
|
major
|
|
| #9593 |
spring layout does not converge on some graphs
|
new
|
jason, ncohen, rlm
|
defect
|
major
|
|
| #9699 |
Barycentric embedding for planar graphs.
|
needs_work
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #9707 |
Add a "signless" option to laplacian
|
new
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #9716 |
tachyon 3d plotting of graphs is still screwy
|
new
|
jason, ncohen, rlm
|
defect
|
major
|
sage-5.10
|
| #9731 |
Export/Import of GML/Graphml/Yaml files through NetworkX
|
needs_work
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #10206 |
Various issues in find_hamiltonian
|
new
|
jason, ncohen, rlm
|
defect
|
major
|
sage-5.10
|
| #10276 |
Create a random triangulation (max planar graph)
|
needs_info
|
jason, ncohen, rlm
|
enhancement
|
major
|
|
| #10482 |
Add Weisfeiler-Leman algorithm to sage.graphs
|
needs_work
|
kini
|
enhancement
|
major
|
sage-5.10
|
| #10531 |
Prevent the plots from being cropped
|
new
|
jason, ncohen, rlm
|
defect
|
major
|
sage-5.10
|
| #10851 |
Refactor the graph visualization code
|
new
|
jason, ncohen, rlm
|
PLEASE CHANGE
|
major
|
sage-wishlist
|
| #11341 |
generate embeddings of a graph up to symmetry
|
new
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #11369 |
generate k-trees up to symmetry
|
needs_review
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #11736 |
Linear time implementation of lex_BFS()
|
needs_work
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #11945 |
Throw exception instead of printing error in c_graph.pyx
|
new
|
jason, ncohen, rlm
|
defect
|
major
|
--
|
| #12027 |
Adding Functionality to the multicommodity_flow() function
|
new
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #12376 |
BipartiteGraph complement
|
needs_info
|
brunellus
|
defect
|
major
|
sage-5.10
|
| #12387 |
Everything is not well with dense graph backends
|
new
|
jason, ncohen, rlm
|
defect
|
major
|
sage-5.10
|
| #12409 |
Naming inconsistency: multiedges/multiples_edges
|
new
|
brunellus
|
defect
|
major
|
sage-5.10
|
| #12540 |
Graph library passes almost surelly erroneous calls without an exception
|
new
|
jason, ncohen, rlm
|
defect
|
major
|
sage-5.10
|
| #12797 |
The cut returned by edge_cut of undirected weighted graphs is sometimes incorrect
|
new
|
jason, ncohen, rlm
|
defect
|
major
|
sage-5.10
|
| #13112 |
inconsistency calling functions for weighted graphs
|
new
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #13185 |
Faces of embedded graphs
|
new
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #13239 |
Contraction of edges in a graph.
|
needs_info
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #13280 |
Extend SubgraphSearch class
|
needs_work
|
vdelecroix
|
enhancement
|
major
|
sage-5.10
|
| #13283 |
Tolerance Graphs (graph generators, etc.)
|
needs_work
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #13380 |
Suurballe-Tarjan algorithm for pair of disjoint st-paths
|
needs_info
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #13418 |
Add method for drawing graphs using Ivan Kuckir graph drawer
|
needs_info
|
slabbe
|
enhancement
|
major
|
sage-5.10
|
| #13521 |
Make vertex labels more flexible
|
new
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #13549 |
Online algorithm environment
|
new
|
brunellus
|
enhancement
|
major
|
sage-5.10
|
| #13583 |
Add rcm to graphs/graph.py
|
new
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #13730 |
Speed up some graph iterations
|
needs_work
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #13744 |
Bug in modular_decomposition
|
needs_work
|
jason, ncohen, rlm
|
defect
|
major
|
sage-5.10
|
| #13827 |
Allow customization of text in GraphPlot
|
new
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #13874 |
Allow automorphism group of a graph to act on the graph's vertex set
|
new
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #13917 |
IndependentSets class
|
needs_review
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #14068 |
nauty_geng is naughty
|
new
|
jason, ncohen, rlm
|
defect
|
major
|
sage-5.10
|
| #14396 |
ISGCI update, small graphs and recognition
|
needs_review
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #14434 |
Implement feedback_vertex_set for graphs
|
needs_review
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #14442 |
Graph.is_circular_planar does not behave as expected
|
needs_review
|
jason, ncohen, rlm
|
defect
|
major
|
sage-5.10
|
| #14515 |
Constructor for triangular graphs
|
needs_review
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #14529 |
Drastic performance improvement of computing the chromatic polynomial
|
new
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #14535 |
Mutability of Graphs
|
needs_review
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #14536 |
Random tournaments, a misnamed method and a segfault
|
positive_review
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #14547 |
McLaughlin graph constructor
|
needs_review
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #14589 |
binary matrices, dense graphs, and faster is_strongly_regular
|
needs_review
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #14614 |
Improved is_triangle_free using bitfileds?
|
new
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #14618 |
Add generators for fullerenes
|
new
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-wishlist
|
| #14619 |
Test if a graph is distance-regular
|
needs_review
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #14631 |
Affine Polar Graphs
|
needs_review
|
jason, ncohen, rlm
|
enhancement
|
major
|
sage-5.10
|
| #14632 |
make generic_graph.plot() pass its options to show
|
positive_review
|
jason, ncohen, rlm
|
defect
|
major
|
sage-5.10
|
| #2266 |
give shortest_paths an optional endpoint
|
new
|
rlm
|
enhancement
|
minor
|
sage-5.10
|
| #6516 |
Latex packages needed for latex versions of graphs
|
new
|
rbeezer
|
defect
|
minor
|
sage-5.10
|
| #6525 |
[with patch, needs work] Enabling some GraphLatex options that were hard coded.
|
needs_work
|
rlm
|
enhancement
|
minor
|
sage-feature
|
| #6546 |
Fully implement edge thickness in plots of graphs
|
new
|
rlm
|
defect
|
minor
|
sage-5.10
|
| #9301 |
Modified check_edge_label in the sparse graph backend to consider equals the same objects rather than objects with the same contents
|
needs_work
|
jason, mvngu, ncohen, rlm
|
defect
|
minor
|
sage-5.10
|
| #9807 |
merge_vertices behavior in a graph with loops
|
new
|
jason, ncohen, rlm
|
defect
|
minor
|
sage-5.10
|
| #10357 |
merge_vertices does not respect loops
|
needs_info
|
jason, ncohen, rlm
|
enhancement
|
minor
|
sage-5.10
|
| #10507 |
In Generic graphs, adjacency matrices with non-negative non-integral entries are treated as "multi-edge" instead of "weighted"
|
new
|
xqwang
|
defect
|
minor
|
|
| #11360 |
The Rubik's Cube group in Sage doesn't support many basic operations for a dumb reason.
|
needs_work
|
jason, ncohen, rlm
|
enhancement
|
minor
|
sage-5.10
|
| #12379 |
Graph chromatic_number - change default algorithm.
|
new
|
jason, ncohen, rlm
|
enhancement
|
minor
|
sage-5.10
|