|
15 | 15 | from mathics.core.convert.expression import ListExpression, from_python, to_mathics_list |
16 | 16 | from mathics.core.element import BaseElement |
17 | 17 | from mathics.core.expression import Expression |
| 18 | +from mathics.core.pattern import pattern_objects |
18 | 19 | from mathics.core.symbols import Symbol, SymbolList, SymbolTrue |
19 | 20 | from mathics.core.systemsymbols import ( |
20 | 21 | SymbolBlank, |
@@ -853,7 +854,6 @@ class AdjacencyList(_NetworkXBuiltin): |
853 | 854 | summary_text = "list the adjacent vertices" |
854 | 855 |
|
855 | 856 | def _retrieve(self, graph, what, neighbors, expression, evaluation): |
856 | | - from mathics.builtin import pattern_objects |
857 | 857 |
|
858 | 858 | if what.get_head_name() in pattern_objects: |
859 | 859 | collected = set() |
@@ -1426,7 +1426,6 @@ def eval(self, graph, what, expression, evaluation, options) -> Optional[Graph]: |
1426 | 1426 | "VertexDelete[graph_, what_, OptionsPattern[VertexDelete]]" |
1427 | 1427 | graph = self._build_graph(graph, evaluation, options, expression) |
1428 | 1428 | if graph: |
1429 | | - from mathics.builtin import pattern_objects |
1430 | 1429 |
|
1431 | 1430 | head_name = what.get_head_name() |
1432 | 1431 | if head_name in pattern_objects: |
@@ -1567,7 +1566,6 @@ def eval(self, graph, what, expression, evaluation, options) -> Optional[Graph]: |
1567 | 1566 | "EdgeDelete[graph_, what_, OptionsPattern[EdgeDelete]]" |
1568 | 1567 | graph = self._build_graph(graph, evaluation, options, expression) |
1569 | 1568 | if graph: |
1570 | | - from mathics.builtin import pattern_objects |
1571 | 1569 |
|
1572 | 1570 | head_name = what.get_head_name() |
1573 | 1571 | if head_name in pattern_objects: |
|
0 commit comments