Welcome to egraph documentation
===============================

**egraph** is a Python library for graph visualization and layout algorithms, providing efficient implementations of various graph algorithms in Rust with Python bindings.

.. toctree::
   :maxdepth: 3
   :caption: Contents:

   getting_started/index
   tutorial/index
   api/index
   examples/index

Features
--------

* Graph data structures (Graph, DiGraph)
* Drawing spaces (Euclidean, Hyperbolic, Spherical, Torus)
* Layout algorithms:
   * Stochastic Gradient Descent (SGD)
   * Multidimensional Scaling (MDS)
   * Stress Majorization
   * Kamada-Kawai
   * Overlap Removal
* Quality metrics for evaluating layout effectiveness
* Integration with NetworkX

Indices and tables
==================

* :ref:`genindex`
* :ref:`search`