Rapturate/Graph_Theory_Using_Flat_Buffers

Go to file

Rapturate da3408dcb7 On branch main

Changes to be committed:
	new file:   Graph.cpp
		1) Moved the actual declarations of functions from Graph.h into this file
		2) Added get_p_edges() which will get all the edges from a specified point p
		3) Added add_edge() which adds an edge between two points (start and end)
	modified:   graph.h
		1) Created initial function, constructor, and deconstructor declarations
		2) Defined Point structure
		3) Defined Edge structure
	modified:   main.cpp
		1) Removed any old code from my last project. I am starting clean on this file.

2026-02-28 13:15:45 -05:00

Graph.cpp

On branch main

2026-02-28 13:15:45 -05:00

graph.h

On branch main

2026-02-28 13:15:45 -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.

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