Lewis Price Rapturate
  • Flat Buffer Graph Theory

    0 Open
    0 Closed

    Developing a three dimensional graph that can be created and altered while maintaining a flat memory curve and instantaneous searching of fastest known paths from one point to another. The known paths will be found using Djikstra's algorithm, Ford-Fulkerson method, breadth first search, depth first search, and likely others then stored in buffers (likely hash maps unless I decide otherwise during the design process).