#9862: Reimplementation of IntervalGraph to handle repeated vertices.
----------------------------------+-----------------------------------------
Reporter: edward.scheinerman | Owner: jason, ncohen, rlm
Type: enhancement | Status: new
Priority: major | Milestone:
Component: graph theory | Keywords: interval graph
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------------+-----------------------------------------
This is a reimplementation of the `IntervalGraph()` constructor to allow
repeated intervals in the list of intervals. The input is a list of
intervals. The output is a graph whose vertices are numbered 0 through n-1
(where n is the length of the list). Vertices u and v are adjacent iff the
u'th and v'th intervals in the input list intersect. The intervals
associated with these vertices are saved with the graph using `set_vertex`
and can be retrieved later using `get_vertex` or `get_vertices`.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9862>
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.
