h-;SrSSKJr SSKJr SSKJrJr SSKr SSK J r SSK r SSKJr SSKJr SS KJr SS KJr "S S \5r"S S\\5rg)zzImplementation of a space that represents graph information where nodes and edges can be represented with euclidean space.) annotations)Sequence)Any NamedTupleN)NDArray)Box)Discrete) MultiDiscrete)Spacec8\rSrSr%SrS\S'S\S'S\S'Srg ) GraphInstanceaA Graph space instance. * nodes (np.ndarray): an (n x ...) sized array representing the features for n nodes, (...) must adhere to the shape of the node space. * edges (Optional[np.ndarray]): an (m x ...) sized array representing the features for m edges, (...) must adhere to the shape of the edge space. * edge_links (Optional[np.ndarray]): an (m x 2) sized array of ints representing the indices of the two nodes that each edge connects. z NDArray[Any]nodeszNDArray[Any] | Noneedges edge_linksN)__name__ __module__ __qualname____firstlineno____doc____annotations____static_attributes__rP/home/james-whalen/.local/lib/python3.13/site-packages/gymnasium/spaces/graph.pyr r s  ##rr c^\rSrSrSrSSU4Sjjjr\S5rSSjrSSU4Sjjjr SSSjjr SSjr SS jr SS jr SS jrSS jrS rU=r$)GraphaVA space representing graph information as a series of ``nodes`` connected with ``edges`` according to an adjacency matrix represented as a series of ``edge_links``. Example: >>> from gymnasium.spaces import Graph, Box, Discrete >>> observation_space = Graph(node_space=Box(low=-100, high=100, shape=(3,)), edge_space=Discrete(3), seed=123) >>> observation_space.sample(num_nodes=4, num_edges=8) GraphInstance(nodes=array([[ 36.47037 , -89.235794, -55.928024], [-63.125637, -64.81882 , 62.4189 ], [ 84.669 , -44.68512 , 63.950912], [ 77.97854 , 2.594091, -51.00708 ]], dtype=float32), edges=array([2, 0, 2, 1, 2, 0, 2, 1]), edge_links=array([[3, 0], [0, 0], [0, 1], [0, 2], [1, 0], [1, 0], [0, 1], [0, 2]], dtype=int32)) c>[U[[45(dS[U535eUb.[U[[45(dS[U535eXlX l[ TU]SSU5 g)a?Constructor of :class:`Graph`. The argument ``node_space`` specifies the base space that each node feature will use. This argument must be either a Box or Discrete instance. The argument ``edge_space`` specifies the base space that each edge feature will use. This argument must be either a None, Box or Discrete instance. Args: node_space (Union[Box, Discrete]): space of the node features. edge_space (Union[None, Box, Discrete]): space of the edge features. seed: Optionally, you can use this argument to seed the RNG that is used to sample from the space. zEValues of the node_space should be instances of Box or Discrete, got NzJValues of the edge_space should be instances of None Box or Discrete, got ) isinstancerr type node_space edge_spacesuper__init__)selfr"r#seed __class__s rr%Graph.__init__3s& h   f RSWXbScRd e f   !S(O o[\`ak\l[mn o%$ tT*rcg)zDChecks whether this space can be flattened to a :class:`spaces.Box`.Frr&s ris_np_flattenableGraph.is_np_flattenableSsrc US:XdUcg[U[5(a[[R"[ SU5UR /-5[R"[ SU5UR /-5U4UR-URURS9$[U[5(a"[UR/U-URS9$[S[U5S35e)Nr)lowhighshapedtyper')nvecr'z9Expects base space to be Box and Discrete, actual space: .)r rnparraymaxr0r1r2r3 np_randomr r n TypeErrorr!)r& base_spacenums r_generate_sample_spaceGraph._generate_sample_spaceXs !8z) j# & &HHSC[JNN+;;<XXc!SkZ__,==>fz/// &&^^   H - - z||ns&:P PKDQ[L\K]]^_ rc>Uc{URc*[TU] S5URRS54$[TU] S5URRS5URRS54$[ U[ 5(GaFURc[TU] U5n[ UR R[R"[R5R55n[TU] U5 X RRU54$[TU] U5nUR R[R"[R5RSS9up4[TU] U5 UURR[ U55URR[ U554$[ U[[45(aURcV[U5S:wa[S[U535e[TU] US5URRUS54$[U5S:wa[S [U535e[TU] US5URRUS5URRUS54$[!S [#U535e) aSeeds the PRNG of this space and node / edge subspace. Depending on the type of seed, the subspaces will be seeded differently * ``None`` - The root, node and edge spaces PRNG are randomly initialized * ``Int`` - The integer is used to seed the :class:`Graph` space that is used to generate seed values for the node and edge subspaces. * ``Tuple[int, int]`` - Seeds the :class:`Graph` and node subspace with a particular value. Only if edge subspace isn't specified * ``Tuple[int, int, int]`` - Seeds the :class:`Graph`, node and edge subspaces with a particular value. Args: seed: An optional int or tuple of ints for this space and the node / edge subspaces. See above for more details. Returns: A tuple of two or three ints depending on if the edge subspace is specified. N))sizerAzGExpects a tuple of two values for Graph and node space, actual length: rr/zOExpects a tuple of three values for Graph, node and edge space, actual length: z3Expects `None`, int or tuple of ints, actual type: )r#r$r'r"r intr9integersr6iinfoint32r8listtuplelen ValueErrorr;r!)r&r' super_seed node_seed edge_seedr(s rr' Graph.seedmsv$ <&w|D)4??+?+?+EEEGL&OO((.OO((. c " "&"W\$/  7 78J8N8N OP  T"!??#7#7 #BBB"W\$/ '+~~'>'>HHRXX&**(?($  T"OO((Y8OO((Y8 tUm , ,&t9>$abefjbkalmw|DG,doo.B.B47.KKKt9>$ijmnrjsitu GLa)OO((a1OO((a1 Ed4j\R rc^US:d SU35eUbUb[SUSU35eUbUunmSnOUbUunmSnOS=n=mnUcKUS:a!URRX3S- -5nOSnTb[U4S j[ U555mO@UR c#[ RRS US 35 US:d S U35eUceURURU5nUceURUR U5nUbXe0n UT0n O0=pUR"S0U D6n Sn UbUR"S0U D6n Sn U b1US:a+URRSX4S 4[RS9n [XU 5$)aGenerates a single sample graph with num_nodes between ``1`` and ``10`` sampled from the Graph. Args: mask: An optional tuple of optional node and edge mask that is only possible with Discrete spaces (Box spaces don't support sample masks). If no ``num_edges`` is provided then the ``edge_mask`` is multiplied by the number of edges probability: An optional tuple of optional node and edge probability mask that is only possible with Discrete spaces (Box spaces don't support sample probability masks). If no ``num_edges`` is provided then the ``edge_mask`` is multiplied by the number of edges num_nodes: The number of nodes that will be sampled, the default is `10` nodes num_edges: An optional number of edges, otherwise, a random number between `0` and :math:`num_nodes^2` Returns: A :class:`GraphInstance` with attributes `.nodes`, `.edges`, and `.edge_links`. rzDThe number of nodes is expected to be greater than 0, actual value: NzIOnly one of `mask` or `probability` can be provided, actual values: mask=z, probability=mask probabilityr/c3(># UHnTv M g7fNr).0_edge_space_masks r Graph.sample..s'RAQAAQszThe number of edges is set (z) but the edge space is None.z@Expects the number of edges to be greater than 0, actual value: rA)r0r1rBr3r)rKr9rErIranger#gymloggerwarnr>r"sampler6rGr )r&rQrR num_nodes num_edgesnode_space_mask mask_typesampled_node_spacesampled_edge_spacenode_sample_kwargsedge_sample_kwargs sampled_nodes sampled_edgessampled_edge_linksrWs @rr^ Graph.samplesB M ^ QR[Q\ ] ^    7[\`[aaop{o|}  /3 ,O_I  $/: ,O_%I<@ @O @o   1} NN33IQ4OP  *"''RyAQ'R"R& 29+=Z[Q ^QR[Q\] ^$$$!88)T!---!88)T  "+!= "+_!= 68 8 *11G4FG   ).55K8JKM!  $Q!%!8!8IN"(("9" ];MNNrc ^[U[5(Ga[UR[R5(Ga[ U4SjUR55(Ga[UR [R5(GaE[UR[R5(GaUR ceURceTRb[ U4SjUR 55(a[R"URR[R5(aURR[UR 5S4:Xa^[R "[R"URS:UR[UR5:55(aggUR SL=(a URSL$g)z?Return boolean specifying if x is a valid member of this space.c3@># UHoTR;v M g7frT)r")rUnoder&s rrX!Graph.contains..sC74t.7Nc3@># UHoTR;v M g7frT)r#)rUedger&s rrXrns"Owt4??#:wrorArTF)r r rr6ndarrayallrrr# issubdtyper3integerr2rJ logical_and)r&xs` rcontainsGraph.containssO a ' '!''2::..C177CCC!!''2::66: bjj<< !ww222 ||777??6""Oqww"OOO#%==1C1CRZZ#P#P'(||'9'9c!''lA=N'N+-66,.NN01 0A01 s177|0K-.,*,* 48 !ww$G1<<43GGrc<SURSURS3$)zA string representation of this space. The representation will include ``node_space`` and ``edge_space`` Returns: A representation of the space zGraph(z, ))r"r#r+s r__repr__Graph.__repr__*s#(4??*;1==rc[U[5=(a9 URUR:H=(a URUR:H$)z5Check whether `other` is equivalent to this instance.)r rr"r#)r&others r__eq__ Graph.__eq__4sA ue $ 6E$4$44 6E$4$44 rc/nUHnSURR50nURbGURb:URR5US'URR5US'UR U5 M U$)zCConvert a batch of samples from this space to a JSONable data type.rrr)rtolistrrappend)r&sample_nret_nr^rets r to_jsonableGraph.to_jsonable<sFFLL//12C||'F,=,=,I%||224G $*$5$5$<$<$>L! LL    rc /nUHnSU;aURce[[R"USURR S9[R"USURR S9[R"US[R S95nO7[[R"USURR S9SS5nURU5 M U$)zCConvert a JSONable data type to a batch of samples from this space.rNr)r3r)r#r r6asarrayr"r3rGr)r&rrr^rs r from_jsonableGraph.from_jsonableIs$&F& 222%JJvgdoo6K6KLJJvgdoo6K6KLJJvl3288D &JJvgdoo6K6KL JJu  r)r#r"rT)r"zBox | Discreter#None | Box | Discreter'z int | np.random.Generator | None)r<rr=rDreturnzBox | MultiDiscrete | None)r'z3int | tuple[int, int] | tuple[int, int, int] | Nonerz&tuple[int, int] | tuple[int, int, int])NN N) rQZNone | tuple[NDArray[Any] | tuple[Any, ...] | None, NDArray[Any] | tuple[Any, ...] | None]rRrr_rDr`z int | Nonerr )rwr rbool)rstr)rrrr)rzSequence[GraphInstance]rz"list[dict[str, list[int | float]]])rz2Sequence[dict[str, list[list[int] | list[float]]]]rzlist[GraphInstance])rrrrrr%propertyr,r>r'r^rxr|rrrr __classcell__)r(s@rrrs.26 +"+*+/ ++@/69 #,KODGD /DDZ   $ZO ZO ZOZOZO !ZOx6>  /  + J rr)r __future__rcollections.abcrtypingrrnumpyr6 numpy.typingr gymnasiumr[gymnasium.spaces.boxrgymnasium.spaces.discreter gymnasium.spaces.multi_discreter gymnasium.spaces.spacer r rrrrrsHA"$" $.9( $J $~E- ~r