o
    ִi                     @   sR   d dl Z d dlZdd Zdd Zdd Zdd	 Zd
d Ze j	dddd Z
dS )    Nc                  C   s    t d} tt jt j|  d S )N   )nxcycle_graphpytestraisesNetworkXErrorflow_hierarchyG r   [/home/kuhnn/.local/lib/python3.10/site-packages/networkx/algorithms/tests/test_hierarchy.pytest_hierarchy_undirected   s   
r   c                  C   s(   t jdt  d} t | dksJ d S )Nr   create_usingg        )r   r   DiGraphr   r	   r   r   r   test_hierarchy_cycle   s   r   c                  C   s*   t jddt  d} t | dksJ d S )N      r   g      ?)r   full_rary_treer   r   r	   r   r   r   test_hierarchy_tree   s   r   c                  C   s,   t  } | g d t | dksJ d S )N))r      )r   r   )r      )r   r   )r      )r   r   g      ?r   r   add_edges_fromr   r	   r   r   r   test_hierarchy_1   s   r   c                  C   st   t  } | ddddifddddifddddifddddifddddifddddifg t j| dd	d
ks8J d S )Nr   r   weightg333333?r   g?r   r   )r   g      ?r   r	   r   r   r   test_hierarchy_weight   s   
r   n)r   r   r   c                 C   sP   t j| t jd}tjt jdd t | W d    d S 1 s!w   Y  d S )Nr   z .*not applicable to empty graphs)match)r   empty_graphr   r   r   r   r   )r   r
   r   r   r   test_hierarchy_empty_graph*   s   "r!   )r   networkxr   r   r   r   r   r   markparametrizer!   r   r   r   r   <module>   s    