|
10 | 10 | from inspect import isgenerator |
11 | 11 | from typing import Callable, Optional, Union |
12 | 12 |
|
13 | | -from mathics.builtin.base import AtomBuiltin, Builtin |
| 13 | +from mathics.core.builtin import AtomBuiltin, Builtin |
14 | 14 | from mathics.core.atoms import Atom, Integer, Integer0, Integer1, Integer2, String |
15 | 15 | from mathics.core.convert.expression import ListExpression, from_python, to_mathics_list |
16 | 16 | from mathics.core.element import BaseElement |
@@ -853,7 +853,7 @@ class AdjacencyList(_NetworkXBuiltin): |
853 | 853 | summary_text = "list the adjacent vertices" |
854 | 854 |
|
855 | 855 | def _retrieve(self, graph, what, neighbors, expression, evaluation): |
856 | | - from mathics.builtin import pattern_objects |
| 856 | + from mathics.core.pattern import pattern_objects |
857 | 857 |
|
858 | 858 | if what.get_head_name() in pattern_objects: |
859 | 859 | collected = set() |
@@ -1430,7 +1430,7 @@ def eval(self, graph, what, expression, evaluation, options) -> Optional[Graph]: |
1430 | 1430 | "VertexDelete[graph_, what_, OptionsPattern[VertexDelete]]" |
1431 | 1431 | graph = self._build_graph(graph, evaluation, options, expression) |
1432 | 1432 | if graph: |
1433 | | - from mathics.builtin import pattern_objects |
| 1433 | + from mathics.core.pattern import pattern_objects |
1434 | 1434 |
|
1435 | 1435 | head_name = what.get_head_name() |
1436 | 1436 | if head_name in pattern_objects: |
@@ -1571,7 +1571,7 @@ def eval(self, graph, what, expression, evaluation, options) -> Optional[Graph]: |
1571 | 1571 | "EdgeDelete[graph_, what_, OptionsPattern[EdgeDelete]]" |
1572 | 1572 | graph = self._build_graph(graph, evaluation, options, expression) |
1573 | 1573 | if graph: |
1574 | | - from mathics.builtin import pattern_objects |
| 1574 | + from mathics.core.pattern import pattern_objects |
1575 | 1575 |
|
1576 | 1576 | head_name = what.get_head_name() |
1577 | 1577 | if head_name in pattern_objects: |
|
0 commit comments