WIP

Author: habedi

README.md

@@ -7,7 +7,7 @@
 </div>
 <br>
 
-# Graphina
+## Graphina
 
 [![Tests](https://img.shields.io/github/actions/workflow/status/habedi/graphina/tests.yml?label=tests&style=popout-square&logo=github)](https://github.com/habedi/graphina/actions/workflows/tests.yml)
 [![Lint](https://img.shields.io/github/actions/workflow/status/habedi/graphina/lint.yml?label=lints&style=popout-square&logo=github)](https://github.com/habedi/graphina/actions/workflows/lint.yml)
@@ -37,7 +37,7 @@ Check out [pygraphina](pygraphina/) directory for more details.
 > Graphina is in the early stages of development, so breaking changes may occur.
 > Bugs and API inconsistencies are also expected, and the algorithms may not yet be optimized for performance.
 
-## Structure
+### Structure
 
 Graphina consists of two main parts: a *core library* and *extensions*.
 The core library provides the basic data structures and algorithms for working with graphs.
@@ -46,7 +46,7 @@ community detection, link prediction, and calculating node and edge centrality s
 
 The extensions are independent of each other. However, they depend on the core library for the basic graph operations.
 
-### Graphina Core
+#### Graphina Core
 
 | Module                                   | Feature/Algorithm                                                                                                                                                                             | Status | Notes                                             |
 |------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|--------|---------------------------------------------------|
@@ -58,7 +58,7 @@ The extensions are independent of each other. However, they depend on the core l
 | [**MST**](src/core/mst.rs)               | <ul><li>Prim’s algorithm</li><li>Kruskal’s algorithm</li><li>Borůvka’s algorithm</li></ul>                                                                                                    | Tested | Minimum spanning tree algorithms                  |
 | [**Traversal**](src/core/traversal.rs)   | <ul><li>Breadth-first search (BFS)</li><li>Depth-first search (DFS)</li><li>Iterative deepening DFS</li><li>Bidirectional search</li></ul>                                                    | Tested | Graph traversal algorithms                        |
 
-### Extensions
+#### Extensions
 
 | Module                                               | Feature/Algorithm                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    | Status | Notes                                                     |
 |------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|--------|-----------------------------------------------------------|
@@ -71,30 +71,30 @@ The extensions are independent of each other. However, they depend on the core l
 > Status shows whether the module is `Tested` and `Benchmarked`.
 > Empty status means the module is implemented but not tested and benchmarked yet.
 
-## Installation
+### Installation
 
 ```
 cargo add graphina
 ```
 
 *Graphina requires Rust 1.83 or later.*
 
-## Documentation
+### Documentation
 
 See the [docs](docs/README.md) for the latest documentation.
 
 Check out the [docs.rs/graphina](https://docs.rs/graphina) for the latest API documentation.
 
-## Contributing
+### Contributing
 
 See [CONTRIBUTING.md](CONTRIBUTING.md) for details on how to make a contribution.
 
-## Logo
+### Logo
 
 The mascot is named "Graphina the Dinosaur" who thinks she's a dragon.
-The logo was created using ComfyUI and a Flex Schnell v2 model.
+The logo was created using Gimp, ComfyUI, and a Flex Schnell v2 model.
 
-## Licensing
+### Licensing
 
 Graphina is licensed under either of these:
 

logo.png

@@ -1,4 +1,4 @@
-# PyGraphina
+## PyGraphina
 
 [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](LICENSE)
 [![Python version](https://img.shields.io/badge/Python-%3E=3.9-blue)](https://github.com/habedi/graphina)
@@ -7,12 +7,12 @@
 
 PyGraphina Python library allows users to use [Graphina](https://github.com/habedi/graphina) in Python.
 
-## Installation
+### Installation
 
 ```bash
 pip install pygraphina
 ```
 
-## License
+### License
 
 PyGraphina is licensed under the [MIT License](LICENSE).