1. 17 Aug, 2015 2 commits
  2. 11 Aug, 2015 1 commit
  3. 05 Aug, 2015 18 commits
    • Volker Braun's avatar
      Updated Sage version to 6.9.beta1 · 83bef8d5
      Volker Braun authored
      83bef8d5
    • Release Manager's avatar
      Trac #18993: sage-list-packages should ignore files in build/pkgs/ · d585e9cd
      Release Manager authored
      At the moment, {{{sage-list-packages}}} does not ignore files in
      {{{build/pkgs}}}, which can lead to errors if, say, your browser has
      automatically created a file after viewing this folder:
      
      {{{
      jkeitel@pcl337b:~/sage/sage_optional> ./sage -optional
      Traceback (most recent call last):
        File "/home/pcl337b/jkeitel/sage/sage_optional/src/bin/sage-list-
      packages", line 57, in <module>
          with open(os.path.join(SAGE_PKGS, p, "package-version.txt")) as f:
      IOError: [Errno 20] Not a directory:
      '/home/pcl337b/jkeitel/sage/sage_optional/build/pkgs/.directory/package-
      version.txt'
      }}}
      
      I am attaching a simple patch that ignores files and only checks
      folders.
      
      URL: http://trac.sagemath.org/18993
      Reported by: jkeitel
      Ticket author(s): Jan Keitel
      Reviewer(s): Volker Braun
      d585e9cd
    • Release Manager's avatar
      Trac #18991: Remove useful doctest · 4e1711e8
      Release Manager authored
      Because people make mistakes and blame their computer (see #18948 to be
      truly appalled by the decision).
      
      Nathann
      
      URL: http://trac.sagemath.org/18991
      Reported by: ncohen
      Ticket author(s): Nathann Cohen
      Reviewer(s): Dima Pasechnik
      4e1711e8
    • Jan Keitel's avatar
      Ignore files in spkg directory · 68e5d145
      Jan Keitel authored
      68e5d145
    • Release Manager's avatar
      Trac #18988: Orthogonal Polar graphs in strongly_regular_graph · 64625bc7
      Release Manager authored
      As reported by Dima in #18948, a family was missing from the general
      constructor. This branch adds it.
      
      Nathann
      
      URL: http://trac.sagemath.org/18988
      Reported by: ncohen
      Ticket author(s): Nathann Cohen
      Reviewer(s): Dima Pasechnik
      64625bc7
    • Release Manager's avatar
      Trac #18960: Strongly Regular Graphs from two-weight codes · b435c030
      Release Manager authored
      This ticket adds several constructions of strongly regular graphs from
      two-weight codes.
      
      The data used here has been provided by Eric Chen, using information
      available on his database of two-weight codes:
      http://moodle.tec.hkr.se/~chen/research/2-weight-codes/search.php
      
      Nathann
      
      URL: http://trac.sagemath.org/18960
      Reported by: ncohen
      Ticket author(s): Nathann Cohen
      Reviewer(s): Dima Pasechnik
      b435c030
    • Release Manager's avatar
      Trac #18948: Strongly Regular Graphs database · 1b01a852
      Release Manager authored
      This ticket implements a new module names `strongly_regular_db` that
      lets us build one example of strongly regular graph, given four integer
      parametes (v,k,lambda,mu).
      
      It uses Andries Brouwer's database to return more meaningful non-
      existence results, and help us find which constructions are missing from
      the database.
      
      With a bit of luck (and time, and work) it would be great if we could
      reproduce all SRG that are known to exist!
      
      The module has a simple structure:
      
      has a simple structure:
      
      - A `seems_feasible(v,k,l,mu)` function that performs the basic
      artihmetic
        checks to figure out if `(v,k,l,mu)` is realizable. The
        'apparently_feasible_parameters(n)` returns the lists of all
      parameters that
        pass these tests for v<n. When n=1301, the set of parameters it
      returns is
        precisely those that appear on your database (this is checked in the
      code).
      
      - Several functions (is_paley, is_johnson, ...) test if a given set of
        parameters (v,k,l,mu) can be realized with a graph of the
      corresponding family
        (a Paley graph, a Johnson graph, ...). If they can, they return the
      parameters
        of that graph so that it can be built easily.
      
      - The main function `strongly_regular_graph` can be called in two ways:
      
        - `strongly_regular_graph(v,k,l,mu,existence=True)` answers True if
      such a
          graph is known to exists, False if it is known to be infeasible, and
      Unknown
          otherwise.
      
        - `strongly_regular_graph(v,k,l,mu)` attempts to build and return the
          requested graph, and returns a meaningful exception if it cannot.
      
      This branch also updates the package 'graphs', which now ships the
      database in json format.
      
      http://www.steinertriples.fr/ncohen/tmp/graphs-20150724.tar.bz2
      
      Nathann
      
      URL: http://trac.sagemath.org/18948
      Reported by: ncohen
      Ticket author(s): Nathann Cohen
      Reviewer(s): Dima Pasechnik
      1b01a852
    • Nathann Cohen's avatar
      trac #18991: Remove useful doctest · 3ef0f1f8
      Nathann Cohen authored
      3ef0f1f8
    • Release Manager's avatar
      Trac #18989: Incorrect input_alphabet in FiniteStateMachine.disjoint_union · d3a0be9c
      Release Manager authored
      The following behaviour is a bug:
      {{{
      sage: A = Automaton([(0, 0, 0)])
      sage: B = Automaton([(0, 0, 1)])
      sage: A.input_alphabet
      [0]
      sage: B.input_alphabet
      [1]
      sage: (A + B).input_alphabet
      [0]
      }}}
      The resulting input alphabet should be `[0, 1]`.
      
      URL: http://trac.sagemath.org/18989
      Reported by: cheuberg
      Ticket author(s): Clemens Heuberger
      Reviewer(s): Daniel Krenn
      d3a0be9c
    • Release Manager's avatar
      Trac #18938: Refactor shortest paths · 00f87362
      Release Manager authored
      At the moment, there are several methods that compute shortest paths.
      However, there is no standard for inputs and outputs of these methods:
      
       * some of them only work with unweighted graphs (distance_all_pairs(),
      distances_distribution(), eccentricity());
       * some of them use default_weight (shortest_path_all_pairs), while
      others do not check weights (shortest_paths)
       * some of them output paths, while others output predecessors
      (shortest_path_all_pairs).
      
      The goal of this ticket is to standardize all these behaviors, and to
      make all routines work also with weighted graphs. The schema of the
      routine calls I would like to implement is attached (some calls are
      already present).
      
      As a next step, we will include some Boost shortest path algorithms
      (Bellman-Ford, Johnson), with ticket !#18931.
      
      URL: http://trac.sagemath.org/18938
      Reported by: borassi
      Ticket author(s): Michele Borassi
      Reviewer(s): David Coudert
      00f87362
    • Release Manager's avatar
      Trac #17462: Remove the (deprecated) _boundary parameter · 387fe06a
      Release Manager authored
      The _boundary attribute has been deprecated since Sage 6.3 in #15494.
      This
      ticket totally removes it fro the graph class.
      
      The branch fixes a small problem that went probably unnoticed in #15494:
      the
      function Graph.genus was using this attribute (and so has been raising
      warnings
      for one year) but there was no other way to give a list of vertices to
      the
      function. Consequently, this branch turns one of its boolean arguments
      into a
      list, so that this function can be used properly, i.e. without global
      variables.
      
      URL: http://trac.sagemath.org/17462
      Reported by: ncohen
      Ticket author(s): Nathann Cohen
      Reviewer(s): David Coudert
      387fe06a
    • Nathann Cohen's avatar
      trac #18988: Merged with updated #18960 · 45667527
      Nathann Cohen authored
      45667527
    • Nathann Cohen's avatar
      trac #18960: Merged with updated #18948 · 8b899aba
      Nathann Cohen authored
      8b899aba
    • Nathann Cohen's avatar
      trac #18948: Broken doctest · d1d25a03
      Nathann Cohen authored
      d1d25a03
    • Nathann Cohen's avatar
      trac #18948: Merge with updated #18934 · f4f55666
      Nathann Cohen authored
      f4f55666
    • Nathann Cohen's avatar
      trac #18934: Merged with beta0 · 62ce12cc
      Nathann Cohen authored
      62ce12cc
    • Michele Borassi's avatar
      Removed duplicate reference · 3f371f84
      Michele Borassi authored
      3f371f84
    • Clemens Heuberger's avatar
  4. 04 Aug, 2015 4 commits
  5. 03 Aug, 2015 13 commits
  6. 02 Aug, 2015 2 commits