Rapturate/Graph_Theory_Using_Flat_Buffers
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
6 Commits 1 Branch 0 Tags
f9e80f23a1e4e9c67d81b93c1801fe4b4d14996a
Go to file
Clone
Open with VS Code Open with VSCodium Open with Intellij IDEA
Download ZIP Download TAR.GZ Download BUNDLE
Rapturate f9e80f23a1 Switched from the bulky style of header safety to the 'pragma once' style
2026-02-28 13:21:05 -05:00
Graph.cpp
On branch main
2026-02-28 13:15:45 -05:00
graph.h
Switched from the bulky style of header safety to the 'pragma once' style
2026-02-28 13:21:05 -05:00
LICENSE
Initial commit
2026-02-27 17:55:24 +00:00
main.cpp
On branch main
2026-02-28 13:15:45 -05:00
README.md
Initial commit
2026-02-27 17:55:24 +00:00

README.md

Graph_Theory

A project based around graph theory. I create a coordinate system, store them in a hash map, and then run various mapping algorithms to find the fastest route through various configurations.

Reference in New Issue View Git Blame Copy Permalink
Description
A project based around graph theory and flat buffer memory management. This project was inspired by studying operating systems and networks. Specifically, how the operating system chooses to pull process pages from the disc to memory and how routes are chosen in a network. I am currently working through a redesign. Currently, the two buffers (Points and Edges) are linked lists, but I'm considering options using hash maps to increase the efficiency when looking for specific Points and Edges. NOTE: This is an active project and will NOT compile yet.
Readme MIT 312 KiB
Languages
C++ 100%