You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
We need a class for #3350 that will be the interface to the query algorithm and the customize algorithm:
When talking about node and edge ID this will refer to the IDs of the Edge-Based-Graph stored in the .ebg file.
Some pseudo code of a possible interface:
classMultiLevelPartition
{
// Returns the ID of the cell of `node` at `level`
CellID GetCellID(NodeID node, LevelID level);
// Returns the ID of the level in which `node` is relevant for our query// That is the lowest level in which node is not in the same cell as start or target
LevelID GetQuerryLevelID(NodeID start, NodeID target, NodeID node);
std::size_tGetNumberOfLevels() const = 0;
std::size_tGetNumberOfCells(LevelID level) const = 0;
};
The data for this class will be provided by the partitioner outlined in #3204.
CellID can be either continuous or not. The latter enables compact packing into a 32bit integer, the former makes the data structure to look up the actual cells more memory efficient.
The text was updated successfully, but these errors were encountered:
We need a class for #3350 that will be the interface to the query algorithm and the customize algorithm:
When talking about node and edge ID this will refer to the IDs of the Edge-Based-Graph stored in the
.ebg
file.Some pseudo code of a possible interface:
The data for this class will be provided by the partitioner outlined in #3204.
CellID
can be either continuous or not. The latter enables compact packing into a32bit
integer, the former makes the data structure to look up the actual cells more memory efficient.The text was updated successfully, but these errors were encountered: