id summary reporter owner description type status priority milestone component resolution keywords cc merged author reviewer upstream work_issues branch commit dependencies stopgaps
9862 Reimplementation of IntervalGraph to handle repeated vertices. edward.scheinerman jason ncohen rlm 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`. enhancement closed major sage-4.6 graph theory fixed interval graph sage-4.6.alpha1 Nathann Cohen Ed Scheinerman N/A