#1941: Finish bipartite graph implementation
----------------------------+-----------------------------------------------
   Reporter:  rlm           |          Owner:  rlm     
       Type:  defect        |         Status:  new     
   Priority:  major         |      Milestone:  sage-5.0
  Component:  graph theory  |       Keywords:          
Work_issues:                |       Upstream:  N/A     
   Reviewer:                |         Author:          
     Merged:                |   Dependencies:          
----------------------------+-----------------------------------------------
Description changed by brunellus:

Old description:

> Systematically go through the functions of graph and generic_graph and
> see which ones, such as add_vertex, need to be overridden in the
> bipartite graph class so that everything makes sense. Right now, you can
> add an edge so that the bipartite graph is no longer bipartite.
>
>  1. add to `__cmp__` to distinguish Bipartite from other graphs
>  1. loops - this should always be false for bipartite, right? (other
> functions with "loops" in the name)
>  1. density - should this reflect "bipartite density"?
>  1. #8330: add_vertex, add_vertices
>  1. clear - left & right too?
>  1. add left_vertices and right_vertices?
>  1. complement?
>  1. #8329: copy
>  1. #10959, #8744: add_edge(s)
>  1. adjacency_matrix - should this order the vertices a certain way?
>  1. add_cycle
>  1. add_path
>  1. add a function "bipartite_subgraph" to preserve class?
>  1. bipartite_color, bipartite_sets, is_bipartite

New description:

 Systematically go through the functions of graph and generic_graph and see
 which ones, such as add_vertex, need to be overridden in the bipartite
 graph class so that everything makes sense. Right now, you can add an edge
 so that the bipartite graph is no longer bipartite.

  1. add to `__cmp__` to distinguish Bipartite from other graphs
  1. loops - this should always be false for bipartite, right? (other
 functions with "loops" in the name)
  1. density - should this reflect "bipartite density"?
  1. #8330: add_vertex, add_vertices
  1. clear - left & right too?
  1. add left_vertices and right_vertices?
  1. #12376: complement?
  1. #8329: copy
  1. #10959, #8744: add_edge(s)
  1. adjacency_matrix - should this order the vertices a certain way?
  1. add_cycle
  1. add_path
  1. add a function "bipartite_subgraph" to preserve class?
  1. bipartite_color, bipartite_sets, is_bipartite

--

-- 
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/1941#comment:10>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica, 
and MATLAB

-- 
You received this message because you are subscribed to the Google Groups 
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to 
[email protected].
For more options, visit this group at 
http://groups.google.com/group/sage-trac?hl=en.

Reply via email to