https://github.com/ganzerli/e-pathy

e-pathy saves integers (also in a file) in a way that you can find them following a path. /0/1/50/0 for example
https://github.com/ganzerli/e-pathy

binary-data c data-structures database graph graph-algorithms

Last synced: 6 months ago
JSON representation

e-pathy saves integers (also in a file) in a way that you can find them following a path. /0/1/50/0 for example

• Host: GitHub
• URL: https://github.com/ganzerli/e-pathy
• Owner: ganzerli
• License: gpl-3.0
• Created: 2023-09-03T14:58:54.000Z (over 2 years ago)
• Default Branch: main
• Last Pushed: 2025-02-17T17:52:03.000Z (10 months ago)
• Last Synced: 2025-03-10T15:18:49.093Z (10 months ago)
• Topics: binary-data, c, data-structures, database, graph, graph-algorithms
• Language: C
• Homepage:
• Size: 224 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# e-pathy

e-pathy saves integers (also in a file) in a way that you can find them following a path. /0/1/50/0 for example.

e-pathy is a database shaped as a graph, where you can navigate throught paths and save data in branches, or create other branches in branches.

The goal of the project is to have an extremely fast search, and save memory.

There is a garbage collection: when you delete data the locations are written in a file, adding new data, if the count is available, are written in deleted spots.

How it works:

- compile and start e-pathy.

- compile and start relacy.

- using a browser write the url: http://localhost:8086/

No other server needed, relacy has already a backend-framework integrated.

Write in the form your nodes separated by space, navigate into the nodes, and create other nodes in nodes.

Compile linux with: gcc -o e-pathy e-pathy.c