# Entry Graphs
Entry graphs are graphs which represent a subset of the ontological network of the database.
It is a graph representation of the database, with vertices representing entries and edges representing 
relationships between entries.

```{image} ../resources/eg.svg
    :width: 600px
    :align: center
```

Entry graphs are created from a set of given initial entries.
Entry graphs can be expanded from the initial entries by calling exploration protocols.
For more information on the built-in protocols, as well as how to define your own, see 
[Exploration Protocols](/content/explorationprotocols).

When an entry graph has been expanded, the scoring algorithm can be used to assign scores to each entry, broadly
speaking represeenting the _connectedness_ of each entry.
See [Scoring](/content/scoring) for details.

ChemRecon provides a number of methods for inspecting the entry graph.
However, for more advanced analysis, we recommend using the underlying graph library, 
[rustworkx](https://www.rustworkx.org/).
The underlying graph object is available as the `g` attribute of the entry graph.
For the directed graphs used in ChemRecon, refer to the following documentation: 
[rustworkx.PyDiGraph](https://www.rustworkx.org/apiref/rustworkx.PyDiGraph.html).

This page documents the API for the entry graphs.

```{eval-rst}
.. autoclass:: chemrecon.EntryGraph
```

```{eval-rst}
.. autoclass:: chemrecon.Vertex
```

```{eval-rst}
.. autoclass:: chemrecon.Edge
```