arguebuf 2.6.2__tar.gz → 2.7.0__tar.gz

{arguebuf-2.6.2 → arguebuf-2.7.0}/PKG-INFO

@@ -1,30 +1,27 @@
-Metadata-Version: 2.1
+Metadata-Version: 2.2
 Name: arguebuf
-Version: 2.6.2
+Version: 2.7.0
 Summary: Create and analyze argument graphs and serialize them via Protobuf
-Home-page: https://github.com/recap-utr/arguebuf-python
-License: MIT
-Author: Mirko Lenz
-Author-email: info@mirko-lenz.de
-Requires-Python: >=3.11,<4.0
-Classifier: License :: OSI Approved :: MIT License
-Classifier: Programming Language :: Python :: 3
-Classifier: Programming Language :: Python :: 3.11
-Classifier: Programming Language :: Python :: 3.12
-Classifier: Programming Language :: Python :: 3.13
-Provides-Extra: cli
-Provides-Extra: graphviz
-Requires-Dist: arg-services (>=1.6,<2.0)
-Requires-Dist: deepl (>=1.16,<2.0) ; extra == "cli"
-Requires-Dist: graphviz (>=0.20,<0.21)
-Requires-Dist: lxml (>=5.1,<6.0)
-Requires-Dist: networkx (>=3.2,<4.0)
-Requires-Dist: pendulum (>=3.0,<4.0)
-Requires-Dist: pygraphviz (>=1.12,<2.0) ; extra == "graphviz"
-Requires-Dist: typer[all] (>=0.9,<0.10) ; extra == "cli"
-Project-URL: Documentation, https://arguebuf.readthedocs.io/en/latest
+Author-email: Mirko Lenz <mirko@mirkolenz.com>
 Project-URL: Repository, https://github.com/recap-utr/arguebuf-python
+Project-URL: Documentation, https://arguebuf.readthedocs.io
+Project-URL: Issues, https://github.com/recap-utr/arguebuf-python/issues
+Project-URL: Changelog, https://github.com/recap-utr/arguebuf-python/releases
+Requires-Python: >=3.11
 Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: arg-services<2,>=1
+Requires-Dist: networkx<4,>=3
+Requires-Dist: pendulum<4,>=3
+Requires-Dist: graphviz<1,>=0.20
+Requires-Dist: lxml<6,>=5
+Provides-Extra: all
+Requires-Dist: arguebuf[cli,graphviz]; extra == "all"
+Provides-Extra: cli
+Requires-Dist: typer<1,>=0.9; extra == "cli"
+Requires-Dist: deepl<2,>=1; extra == "cli"
+Provides-Extra: graphviz
+Requires-Dist: pygraphviz<2,>=1; extra == "graphviz"
 
 # Arguebuf Python
 
@@ -178,4 +175,3 @@ ag.dump.file(graph, "./graph.json", ag.GraphFormat.AIF)
 ## Development
 
 To pull the testing data, make sure to install [DVC](https://dvc.org/doc/install) and run `dvc pull` in the root directory of the repository.
-

arguebuf-2.7.0/pyproject.toml

@@ -0,0 +1,55 @@
+[project]
+name = "arguebuf"
+version = "2.7.0"
+description = "Create and analyze argument graphs and serialize them via Protobuf"
+authors = [{ name = "Mirko Lenz", email = "mirko@mirkolenz.com" }]
+readme = "README.md"
+requires-python = ">=3.11"
+dependencies = [
+    "arg-services>=1,<2",
+    "networkx>=3,<4",
+    "pendulum>=3,<4",
+    "graphviz>=0.20,<1",
+    "lxml>=5,<6",
+]
+
+[project.optional-dependencies]
+all = ["arguebuf[cli,graphviz]"]
+cli = ["typer>=0.9,<1", "deepl>=1,<2"]
+graphviz = ["pygraphviz>=1,<2"]
+
+[project.scripts]
+arguebuf = "arguebuf.cli.app:cli"
+
+[project.urls]
+Repository = "https://github.com/recap-utr/arguebuf-python"
+Documentation = "https://arguebuf.readthedocs.io"
+Issues = "https://github.com/recap-utr/arguebuf-python/issues"
+Changelog = "https://github.com/recap-utr/arguebuf-python/releases"
+
+[dependency-groups]
+test = [
+    "pytest>=8,<9",
+    "pytest-cov>=6,<7",
+    "pytest-xdist>=3,<4",
+    "deepdiff>=8,<9",
+    "lxml-stubs>=0.5,<1",
+]
+docs = ["pdoc>=15,<16"]
+
+[build-system]
+requires = ["setuptools>=61"]
+build-backend = "setuptools.build_meta"
+
+[tool.pytest.ini_options]
+addopts = "--numprocesses 4 --dist load --cov arguebuf --cov-report term-missing --doctest-modules --ignore arguebuf/cli --ignore data --ignore result"
+doctest_optionflags = "NORMALIZE_WHITESPACE IGNORE_EXCEPTION_DETAIL ELLIPSIS"
+
+[tool.ruff]
+target-version = "py311"
+
+[tool.ruff.lint.pydocstyle]
+convention = "google"
+
+[tool.uv]
+default-groups = ["test", "docs"]

arguebuf-2.7.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+

{arguebuf-2.6.2 → arguebuf-2.7.0/src}/arguebuf/__init__.py

@@ -1,5 +1,5 @@
 """
-.. include:: ../README.md
+.. include:: ../../README.md
 """
 
 import logging

{arguebuf-2.6.2 → arguebuf-2.7.0/src}/arguebuf/dump/_dump_dict.py

@@ -20,4 +20,4 @@ def dump_dict(graph: Graph, config: Config = DefaultConfig) -> dict[str, t.Any]:
     elif config.format == Format.XAIF:
         return t.cast(dict[str, t.Any], dump_xaif(graph))
 
-    return MessageToDict(dump_protobuf(graph), including_default_value_fields=False)  # type: ignore
+    return MessageToDict(dump_protobuf(graph))

{arguebuf-2.6.2 → arguebuf-2.7.0/src}/arguebuf/model/scheme.py

@@ -1,4 +1,5 @@
 from enum import Enum
+from typing import cast
 
 from arg_services.graph.v1 import graph_pb2
 
@@ -118,22 +119,28 @@ class Rephrase(str, Enum):
 Scheme = Support | Attack | Rephrase | Preference
 
 support2protobuf = {
-    item: graph_pb2.Support.Value(f"SUPPORT_{item.name}") for item in Support
+    item: cast(graph_pb2.Support, graph_pb2.Support.Value(f"SUPPORT_{item.name}"))
+    for item in Support
 }
 protobuf2support = {value: key for key, value in support2protobuf.items()}
 
 attack2protobuf = {
-    item: graph_pb2.Attack.Value(f"ATTACK_{item.name}") for item in Attack
+    item: cast(graph_pb2.Attack, graph_pb2.Attack.Value(f"ATTACK_{item.name}"))
+    for item in Attack
 }
 protobuf2attack = {value: key for key, value in attack2protobuf.items()}
 
 rephrase2protobuf = {
-    item: graph_pb2.Rephrase.Value(f"REPHRASE_{item.name}") for item in Rephrase
+    item: cast(graph_pb2.Rephrase, graph_pb2.Rephrase.Value(f"REPHRASE_{item.name}"))
+    for item in Rephrase
 }
 protobuf2rephrase = {value: key for key, value in rephrase2protobuf.items()}
 
 preference2protobuf = {
-    item: graph_pb2.Preference.Value(f"PREFERENCE_{item.name}") for item in Preference
+    item: cast(
+        graph_pb2.Preference, graph_pb2.Preference.Value(f"PREFERENCE_{item.name}")
+    )
+    for item in Preference
 }
 protobuf2preference = {value: key for key, value in preference2protobuf.items()}
 

{arguebuf-2.6.2 → arguebuf-2.7.0/src}/arguebuf/render/_render_d2.py

@@ -20,8 +20,7 @@ def d2(
 
     if path.suffix.removeprefix(".") not in FORMATS:
         raise ValueError(
-            "You need to provide a path with a file ending supported by d2:"
-            f" {FORMATS}"
+            f"You need to provide a path with a file ending supported by d2: {FORMATS}"
         )
 
     # Create temporary file

arguebuf-2.7.0/src/arguebuf.egg-info/PKG-INFO

@@ -0,0 +1,177 @@
+Metadata-Version: 2.2
+Name: arguebuf
+Version: 2.7.0
+Summary: Create and analyze argument graphs and serialize them via Protobuf
+Author-email: Mirko Lenz <mirko@mirkolenz.com>
+Project-URL: Repository, https://github.com/recap-utr/arguebuf-python
+Project-URL: Documentation, https://arguebuf.readthedocs.io
+Project-URL: Issues, https://github.com/recap-utr/arguebuf-python/issues
+Project-URL: Changelog, https://github.com/recap-utr/arguebuf-python/releases
+Requires-Python: >=3.11
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: arg-services<2,>=1
+Requires-Dist: networkx<4,>=3
+Requires-Dist: pendulum<4,>=3
+Requires-Dist: graphviz<1,>=0.20
+Requires-Dist: lxml<6,>=5
+Provides-Extra: all
+Requires-Dist: arguebuf[cli,graphviz]; extra == "all"
+Provides-Extra: cli
+Requires-Dist: typer<1,>=0.9; extra == "cli"
+Requires-Dist: deepl<2,>=1; extra == "cli"
+Provides-Extra: graphviz
+Requires-Dist: pygraphviz<2,>=1; extra == "graphviz"
+
+# Arguebuf Python
+
+Arguebuf is a format for serializing argument graphs and specified using Protobuf.
+The complete specification and documentation is available at the [Buf Schema Registry](https://buf.build/recap/arg-services/docs/main:arg_services.graph.v1).
+While Protobuf automatically generates native code for all major programming languages (including Python), we created a custom implementation that provides some additional benefits, including:
+
+- The ability to import existing formats like [AIF](http://www.argumentinterchange.org), [SADFace](https://github.com/Open-Argumentation/SADFace), and a few others.
+- Export of Arguebuf graphs to AIF, [NetworkX](https://networkx.org), and [Graphviz](https://graphviz.org).
+- Integration with the popular NLP library [spaCy](http://spacy.io).
+- Various helper methods to programmatically manipulate/create argument graphs.
+- More pythonic interfaces than the regular code generated by `protoc`.
+
+You can easily install the library from [PyPI](https://pypi.org/project/arguebuf/) using pip. The documentation is hosted on [ReadTheDocs](https://arguebuf.readthedocs.io/en/latest/)
+
+## Command Line Interface (CLI)
+
+We also offer some tools to simplify dealing with structured argument graphs.
+Among others, it is possible to convert graphs between different formats, translate them, and render images using graphviz.
+To use it, install the `cli` extras when installing the package.
+When using `pip`, this can be accomplished with
+
+`pip install arguebuf[cli]`
+
+Afterwards, you can execute it by calling `arguebuf`, for example:
+
+`arguebuf --help`
+
+Alternatively, you can use the Docker image available at `ghcr.io/recap-utr/arguebuf-python`.
+To use it, mount a folder to the container and pass the options as the command.
+
+`docker run --rm -it -v $(pwd)/data:/data ghcr.io/recap-utr/arguebuf-python:latest --help`
+
+If you use the `nix` package manager, you can run it as follows:
+
+`nix run github:recap-utr/arguebuf-python -- --help`
+
+## Theoretical Foundations
+
+An argument graph is way to represent _structured_ argumentation.
+What sets it apart from _unstructured_ argumentation (e.g., in newspaper articles) is that only the essential/argumentative parts of a text art part of this representation.
+These _units_ of argumentation are also called ADUs (argumentative discourse units).
+The length of ADUs can differ dramatically (depending on various factors like the context), meaning they might contain only a few words, a sentence, or even a whole paragraph.
+The structure of an argument is then represented through _relations_ between these units.
+For this purpose, they can be further subdivided into _claims_ and _premises_:
+A claim is a statement that is supported or attacked by one or multiple premises.
+At the same time, a claim may also function as a premise for another claim, making it possible to construct even complex _argument graphs_.
+One of the claims is called _major claim_ and represents the overall claim of the whole argument.
+In many cases (but not all), this major claim is located right at the top of the graph
+Here is a rather simple example.
+
+![Exemplary argument graph](./assets/programmatic.png)
+
+Claims, premises and the major claim are represented as _atom nodes_ while relations between them are represented by _scheme nodes_.
+The set of nodes $V = A \cup S$ is composed of the set of atom nodes $A$ and the set of scheme nodes $S$.
+The supporting or attacking relations are encoded in a set of edges $E \subseteq V \times V \setminus A \times A$.
+Edges can be drawn between any type of nodes except for two atom nodes.
+For instance, it is possible to connect two scheme nodes to support or attack the _inference_ between two ADUs.
+Based on this, we define an argument graph $G$ as the triple $G = ( V , E , M )$.
+
+## User Guide
+
+When importing this library, we recommend using an abbreviation such as `ag` (for _argument graph_).
+
+```python
+import arguebuf as ag
+```
+
+In the following, we will introduce the most important features of `arguebuf`.
+For more details including examples, check out our API documentation.
+
+### Importing an Existing Graph
+
+We support multiple established formats to represent argument graphs: `AIF`, `OVA`, `SADFace`, `ArgDown`, `BRAT`, and `Kialo`.
+Given an input file, the library can automatically determine the correct format and convert it to a representation in the `arguebuf` format.
+One can either pass a string pointing to the file or a `pathlib.Path` object.
+
+```python
+graph = ag.load.file("graph.json")
+```
+
+It is also possible to load multiple graphs within a folder.
+Here, you need to pass the folder along with a [glob pattern](https://docs.python.org/3/library/fnmatch.html#module-fnmatch) for selecting the argument graphs.
+This also enables to recursively load all argument graphs from a common parent directory.
+
+```python
+graphs = ag.load.folder("./data", "**/*.json")
+```
+
+Since atom nodes contain textual information that may need to be analyzed using NLP techniques, we support passing a custom `nlp` function to these loader methods.
+This also makes it really easy to integrate the popular [`spacy` library](http://spacy.io) with `arguebuf` as all texts of atom nodes are automatically converted to a spacy `Doc`.
+
+```python
+import spacy
+nlp = spacy.load("en_core_web_lg")
+graph = ag.load.file("graph.json", nlp=nlp)
+```
+
+### Programmatically Create a New Graph
+
+Instead of importing an existing graph, you can also create a new one using an object-oriented API using our library.
+To illustrate this, we generate a graph with two premises that are connected to a major claim.
+**Please note:** In case edges with nodes not yet contained in the graph are added, the respective nodes are added automatically.
+
+```python
+graph = ag.Graph()
+
+premise1 = ag.AtomNode("Text of premise 1")
+premise2 = ag.AtomNode("Text of premise 2")
+claim = ag.AtomNode("Text of claim")
+
+scheme1 = ag.SchemeNode(ag.Support.DEFAULT)
+scheme2 = ag.SchemeNode(ag.Attack.DEFAULT)
+
+graph.add_edge(ag.Edge(premise1, scheme1))
+graph.add_edge(ag.Edge(scheme1, claim))
+graph.add_edge(ag.Edge(premise2, scheme2))
+graph.add_edge(ag.Edge(scheme2, claim))
+
+graph.major_claim = claim
+gv_graph = ag.dump.graphviz(graph)
+ag.render.graphviz(gv_graph, "./assets/programmatic.png")
+```
+
+With this code, we get the following output
+
+![Output of programmatic graph creation](./assets/programmatic.png)
+
+### Exporting Argument Graphs
+
+We support different output formats and integration with other libraries to ease the use of argument graphs.
+Have a look at the following code snippet to get an overview of the possibilities
+
+```python
+# Export to graphviz DOT format
+dot = ag.dump.graphviz(graph)
+
+# Export an image of this dot source to a file
+ag.render.graphviz(dot, "./graph.pdf")
+
+# Convert to NetworkX graph
+nx = ag.dump.networkx(graph)
+
+# Save the graph as Arguebuf
+ag.dump.file(graph, "./graph.json")
+
+# Save the graph as AIF
+ag.dump.file(graph, "./graph.json", ag.GraphFormat.AIF)
+```
+
+## Development
+
+To pull the testing data, make sure to install [DVC](https://dvc.org/doc/install) and run `dvc pull` in the root directory of the repository.

arguebuf-2.7.0/src/arguebuf.egg-info/SOURCES.txt

@@ -0,0 +1,83 @@
+LICENSE
+README.md
+pyproject.toml
+src/arguebuf/__init__.py
+src/arguebuf/dt.py
+src/arguebuf/py.typed
+src/arguebuf/traverse.py
+src/arguebuf/utils.py
+src/arguebuf.egg-info/PKG-INFO
+src/arguebuf.egg-info/SOURCES.txt
+src/arguebuf.egg-info/dependency_links.txt
+src/arguebuf.egg-info/entry_points.txt
+src/arguebuf.egg-info/requires.txt
+src/arguebuf.egg-info/top_level.txt
+src/arguebuf/cli/__init__.py
+src/arguebuf/cli/__main__.py
+src/arguebuf/cli/app.py
+src/arguebuf/cli/graph.py
+src/arguebuf/cli/model.py
+src/arguebuf/cli/server.py
+src/arguebuf/cli/text.py
+src/arguebuf/cli/translator.py
+src/arguebuf/dump/__init__.py
+src/arguebuf/dump/_config.py
+src/arguebuf/dump/_dump_aif.py
+src/arguebuf/dump/_dump_d2.py
+src/arguebuf/dump/_dump_dict.py
+src/arguebuf/dump/_dump_graphviz.py
+src/arguebuf/dump/_dump_io.py
+src/arguebuf/dump/_dump_json.py
+src/arguebuf/dump/_dump_networkx.py
+src/arguebuf/dump/_dump_path.py
+src/arguebuf/dump/_dump_protobuf.py
+src/arguebuf/dump/_dump_xaif.py
+src/arguebuf/load/__init__.py
+src/arguebuf/load/_config.py
+src/arguebuf/load/_load_aif.py
+src/arguebuf/load/_load_aml.py
+src/arguebuf/load/_load_argdown.py
+src/arguebuf/load/_load_brat.py
+src/arguebuf/load/_load_casebase.py
+src/arguebuf/load/_load_dict.py
+src/arguebuf/load/_load_io.py
+src/arguebuf/load/_load_json.py
+src/arguebuf/load/_load_kialo.py
+src/arguebuf/load/_load_microtexts.py
+src/arguebuf/load/_load_ova.py
+src/arguebuf/load/_load_path.py
+src/arguebuf/load/_load_protobuf.py
+src/arguebuf/load/_load_sadface.py
+src/arguebuf/load/_load_text.py
+src/arguebuf/load/_load_xaif.py
+src/arguebuf/load/_preprocess_aif.py
+src/arguebuf/model/__init__.py
+src/arguebuf/model/analyst.py
+src/arguebuf/model/edge.py
+src/arguebuf/model/graph.py
+src/arguebuf/model/metadata.py
+src/arguebuf/model/node.py
+src/arguebuf/model/participant.py
+src/arguebuf/model/reference.py
+src/arguebuf/model/resource.py
+src/arguebuf/model/scheme.py
+src/arguebuf/model/typing.py
+src/arguebuf/model/userdata.py
+src/arguebuf/model/utils.py
+src/arguebuf/render/__init__.py
+src/arguebuf/render/_render_d2.py
+src/arguebuf/render/_render_graphviz.py
+src/arguebuf/schemas/__init__.py
+src/arguebuf/schemas/aif.py
+src/arguebuf/schemas/argdown.py
+src/arguebuf/schemas/d2.py
+src/arguebuf/schemas/graphviz.py
+src/arguebuf/schemas/microtexts.py
+src/arguebuf/schemas/ova.py
+src/arguebuf/schemas/sadface.py
+src/arguebuf/schemas/xaif.py
+tests/test_create_graph.py
+tests/test_load_casebase.py
+tests/test_load_edge.py
+tests/test_load_node.py
+tests/test_render_graph.py

arguebuf-2.7.0/src/arguebuf.egg-info/dependency_links.txt

@@ -0,0 +1 @@
+

arguebuf-2.7.0/src/arguebuf.egg-info/entry_points.txt

@@ -0,0 +1,2 @@
+[console_scripts]
+arguebuf = arguebuf.cli.app:cli

arguebuf-2.7.0/src/arguebuf.egg-info/requires.txt

@@ -0,0 +1,15 @@
+arg-services<2,>=1
+networkx<4,>=3
+pendulum<4,>=3
+graphviz<1,>=0.20
+lxml<6,>=5
+
+[all]
+arguebuf[cli,graphviz]
+
+[cli]
+typer<1,>=0.9
+deepl<2,>=1
+
+[graphviz]
+pygraphviz<2,>=1

arguebuf-2.7.0/src/arguebuf.egg-info/top_level.txt

@@ -0,0 +1 @@
+arguebuf

arguebuf-2.7.0/tests/test_create_graph.py

@@ -0,0 +1,208 @@
+from pathlib import Path
+
+import pytest
+from arg_services.graph.v1 import graph_pb2
+
+import arguebuf as ag
+
+
+def generate_graph() -> ag.Graph:
+    g = ag.Graph()
+    a1 = ag.AtomNode("", id="a1")
+    a2 = ag.AtomNode("", id="a2")
+    a3 = ag.AtomNode("", id="a3")
+    a4 = ag.AtomNode("", id="a4")
+    s1 = ag.SchemeNode(id="s1")
+    s2 = ag.SchemeNode(id="s2")
+
+    g.add_edge(ag.Edge(a1, s1))
+    g.add_edge(ag.Edge(s1, s2))
+    g.add_edge(ag.Edge(s2, a4))
+    g.add_edge(ag.Edge(a2, s1))
+    g.add_edge(ag.Edge(a3, s2))
+
+    return g
+
+
+def test_strip_scheme_nodes():
+    g = generate_graph()
+    g.strip_scheme_nodes()
+
+    assert len(g.nodes) == 4
+    assert len(g.scheme_nodes) == 0
+    assert len(g.edges) == 3
+
+
+def test_remove_branch():
+    g = generate_graph()
+    g.remove_branch("s2")
+
+    assert len(g.nodes) == 1
+    assert len(g.edges) == 0
+
+
+def test_sibling_nodes():
+    g = ag.Graph()
+
+    a1 = ag.AtomNode("", id="a1")
+    a2 = ag.AtomNode("", id="a2")
+    a3 = ag.AtomNode("", id="a3")
+    a4 = ag.AtomNode("", id="a4")
+    a5 = ag.AtomNode("", id="a5")
+    a6 = ag.AtomNode("", id="a6")
+    s1 = ag.SchemeNode(id="s1")
+    s2 = ag.SchemeNode(id="s2")
+    s3 = ag.SchemeNode(id="s3")
+    s4 = ag.SchemeNode(id="s4")
+    s5 = ag.SchemeNode(id="s5")
+
+    g.add_edge(ag.Edge(a1, s1))
+    g.add_edge(ag.Edge(a2, s2))
+    g.add_edge(ag.Edge(s1, a3))
+    g.add_edge(ag.Edge(s2, a3))
+    g.add_edge(ag.Edge(a3, s3))
+    g.add_edge(ag.Edge(s3, a4))
+    g.add_edge(ag.Edge(s4, a4))
+    g.add_edge(ag.Edge(a5, s4))
+    g.add_edge(ag.Edge(s5, a5))
+    g.add_edge(ag.Edge(a6, s5))
+
+    siblings = g.sibling_node_distances(a2)
+
+    assert len(siblings) == 3
+    assert siblings[a1] == 2
+    assert siblings[a6] == 4
+
+
+def test_create_graph(tmp_path: Path):
+    g = ag.Graph("Test")
+
+    p1 = ag.Participant(
+        name="Participant 1",
+        username="Parti 1",
+        email="Parti1@gmail.com",
+        url="thesenuts",
+        location="Trier",
+        description="Hallo Welt!",
+    )
+    g.add_participant(p1)
+    r1 = ag.Resource("Resource234")
+    g.add_resource(r1)
+    n1 = ag.AtomNode(
+        text="Node 1",
+        reference=ag.Reference(r1, 0, "Resource234"),
+        participant=p1,
+    )
+    n2 = ag.SchemeNode(ag.Support.DEFAULT)
+    n3 = ag.AtomNode("Node 3")
+    n4 = ag.SchemeNode(ag.Support.DEFAULT)
+    n5 = ag.AtomNode("Node 5")
+    e12 = ag.Edge(n1, n2)
+    e23 = ag.Edge(n2, n3)
+    e34 = ag.Edge(n3, n4)
+    e45 = ag.Edge(n4, n5)
+
+    g.add_node(n1)
+    g.add_edge(e12)
+    g.add_edge(e23)
+    g.add_edge(e34)
+    g.add_edge(e45)
+
+    assert e12.source == n1
+    assert e12.target == n2
+    assert e23.source == n2
+    assert e23.target == n3
+    assert e34.source == n3
+    assert e34.target == n4
+    assert e45.source == n4
+    assert e45.target == n5
+
+    assert len(g.incoming_nodes(n1)) == 0
+    assert len(g.incoming_edges(n1)) == 0
+    assert len(g.incoming_nodes(n3)) == 1
+    assert len(g.incoming_edges(n3)) == 1
+    assert len(g.incoming_edges(n5)) == 1
+    assert len(g.incoming_edges(n5)) == 1
+
+    assert len(g.outgoing_nodes(n1)) == 1
+    assert len(g.outgoing_edges(n1)) == 1
+    assert len(g.outgoing_nodes(n3)) == 1
+    assert len(g.outgoing_edges(n3)) == 1
+    assert len(g.outgoing_nodes(n5)) == 0
+    assert len(g.outgoing_edges(n5)) == 0
+
+    assert g.root_node == n5
+    assert g.major_claim is None
+    g.major_claim = n5
+    assert g.major_claim == n5
+
+    assert set(g.nodes.values()) == {n1, n2, n3, n4, n5}
+
+    assert ag.traverse.node_distance(n1, n1, g.outgoing_nodes) == 0
+    assert ag.traverse.node_distance(n1, n2, g.outgoing_nodes) == 1
+    assert ag.traverse.node_distance(n1, n3, g.outgoing_nodes) == 2
+    assert ag.traverse.node_distance(n1, n4, g.outgoing_nodes) == 3
+    assert ag.traverse.node_distance(n1, n5, g.outgoing_nodes) == 4
+    assert ag.traverse.node_distance(n2, n2, g.outgoing_nodes) == 0
+    assert ag.traverse.node_distance(n3, n3, g.outgoing_nodes) == 0
+    assert ag.traverse.node_distance(n4, n4, g.outgoing_nodes) == 0
+    assert ag.traverse.node_distance(n5, n5, g.outgoing_nodes) == 0
+    assert g.scheme_between(n1, n3) == n2
+    assert g.outgoing_atom_nodes(n1) == {n3}
+
+    assert len(g.resources) == 1
+    r2 = ag.Resource(text="Resource", title="Resourca", source="Wikipedia")
+    assert r2.plain_text == "Resource"
+    g.add_resource(r2)
+    g.add_resource(ag.Resource("Resource2"))
+    assert len(g.resources) == 3
+    assert len(g.atom_nodes) > 0
+    assert len(g.scheme_nodes) > 0
+    g.incoming_nodes(n3)
+    g.incoming_atom_nodes(n2)
+    g.outgoing_nodes(n3)
+    g.outgoing_atom_nodes(n2)
+    g.incoming_edges(n3)
+    g.outgoing_edges(n3)
+
+    g.remove_node(n4)
+    g.add_node(n4)
+
+    # e4 = "Hallo ich bin keine Kante"
+    # g.add_edge(e4)
+
+    with pytest.raises(ValueError):
+        g.add_edge(e12)
+
+    # r10 = "Hallo ich bin keine Quelle"
+    # g.add_resource(r10)
+
+    with pytest.raises(ValueError):
+        g.add_resource(r2)
+
+    # g.remove_resource(r10)
+    g.remove_resource(r2)
+
+    with pytest.raises(ValueError):
+        g.remove_resource(r2)
+
+    # p3 = "Hallo ich bin kein Teilnehmer"
+    # g.add_participant(p3)
+
+    with pytest.raises(ValueError):
+        g.add_participant(p1)
+    # g.remove_participant(p3)
+    g.remove_participant(p1)
+
+    with pytest.raises(ValueError):
+        g.remove_participant(p1)
+
+    assert len(g.participants) == 0
+
+    assert isinstance(ag.dump.protobuf(g), graph_pb2.Graph)
+
+    gc = ag.copy(g)
+
+    assert len(g.nodes) == len(gc.nodes)
+
+    ag.render.graphviz(ag.dump.graphviz(g), tmp_path / "test.pdf")