hPSrSSKJr SSKrS/r\R "SSS9S5rg)z Generators for interval graph. )SequenceNinterval_graphT)graphs returns_graphc[U5nUHLn[U[5(a[U5S:Xd [ S5eUSUS:dM@[ SU35e [ R"5nUVs/sHn[U5PM nnURU5 U(aIUR5=upEnUH&nUupXX:dMX:dMURXg5 M( U(aMIU$s snf)aGenerates an interval graph for a list of intervals given. In graph theory, an interval graph is an undirected graph formed from a set of closed intervals on the real line, with a vertex for each interval and an edge between vertices whose intervals intersect. It is the intersection graph of the intervals. More information can be found at: https://en.wikipedia.org/wiki/Interval_graph Parameters ---------- intervals : a sequence of intervals, say (l, r) where l is the left end, and r is the right end of the closed interval. Returns ------- G : networkx graph Examples -------- >>> intervals = [(-2, 3), [1, 4], (2, 3), (4, 6)] >>> G = nx.interval_graph(intervals) >>> sorted(G.edges) [((-2, 3), (1, 4)), ((-2, 3), (2, 3)), ((1, 4), (2, 3)), ((1, 4), (4, 6))] Raises ------ :exc:`TypeError` if `intervals` contains None or an element which is not collections.abc.Sequence or not a length of 2. :exc:`ValueError` if `intervals` contains an interval such that min1 > max1 where min1,max1 = interval zZEach interval must have length 2, and be a collections.abc.Sequence such as tuple or list.rz*Interval must have lower value first. Got ) list isinstancerlen TypeError ValueErrornxGraphtupleadd_nodes_frompopadd_edge) intervalsintervalgraphtupled_intervalsmin1max1 interval1 interval2min2max2s T/var/www/html/env/lib/python3.13/site-packages/networkx/generators/interval_graph.pyrr sJYI8X..3x=A3EB  A;! $I(TU U HHJE8AB Hh B )* !1!5!5!77 Y)I"JD| y4*   LCs7C1)__doc__collections.abcrnetworkxr__all__ _dispatchablerrr's;%  T2939r&