👉 HurryGraph is a graph data structure that represents data in an order-sensitive manner. It's similar to a directed acyclic graph (DAG), but with an extra layer of ordering, allowing for the efficient storage and retrieval of information. In a "hurrygraph", each node has multiple outgoing edges, which are ordered based on their incoming edges. The order is determined by the direction of the edge (left-to-right for left-to-right nodes, right-to-left for right-to-left nodes
