|
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 |
@@ -854,7 +854,6 @@ class AdjacencyList(_NetworkXBuiltin): |
854 | 854 | summary_text = "list the adjacent vertices" |
855 | 855 |
|
856 | 856 | def _retrieve(self, graph, what, neighbors, expression, evaluation): |
857 | | - |
858 | 857 | if what.get_head_name() in pattern_objects: |
859 | 858 | collected = set() |
860 | 859 | match = Matcher(what).match |
@@ -1426,7 +1425,6 @@ def eval(self, graph, what, expression, evaluation, options) -> Optional[Graph]: |
1426 | 1425 | "VertexDelete[graph_, what_, OptionsPattern[VertexDelete]]" |
1427 | 1426 | graph = self._build_graph(graph, evaluation, options, expression) |
1428 | 1427 | if graph: |
1429 | | - |
1430 | 1428 | head_name = what.get_head_name() |
1431 | 1429 | if head_name in pattern_objects: |
1432 | 1430 | cases = Expression( |
@@ -1566,7 +1564,6 @@ def eval(self, graph, what, expression, evaluation, options) -> Optional[Graph]: |
1566 | 1564 | "EdgeDelete[graph_, what_, OptionsPattern[EdgeDelete]]" |
1567 | 1565 | graph = self._build_graph(graph, evaluation, options, expression) |
1568 | 1566 | if graph: |
1569 | | - |
1570 | 1567 | head_name = what.get_head_name() |
1571 | 1568 | if head_name in pattern_objects: |
1572 | 1569 | cases = Expression( |
|
0 commit comments