representations

class ConsecutiveTemporalEdgePartitionStrategy extends PartitionStrategyMoreInfo
class ConsecutiveTemporalPartitionStrategy extends PartitionStrategy
class Hybrid2DEdgePartitionStrategy extends PartitionStrategyMoreInfo
class Hybrid2DPartitionStrategy extends PartitionStrategy
class HybridGraph[VD, ED] extends VEGraph[VD, ED] with Serializable
class HybridRandomCutEdgePartitionStrategy extends PartitionStrategyMoreInfo
class HybridRandomCutPartitionStrategy extends PartitionStrategy
class NaiveTemporalEdgePartitioning extends PartitionStrategyMoreInfo
class NaiveTemporalPartitionStrategy extends PartitionStrategy
class OneGraph[VD, ED] extends TGraphNoSchema[VD, ED]

One graph with attributes stored together Warning: this has a limitation in that there can be only as many tuples of a specific vertex as largest array
class OneGraphColumn[VD, ED] extends VEGraph[VD, ED]
class RepresentativeGraph[VD, ED] extends TGraphNoSchema[VD, ED]
class VEGraph[VD, ED] extends TGraphNoSchema[VD, ED]
class VEGraphOptim[VD, ED] extends VEGraph[VD, ED]

VE with some methods implemented more efficiently

object HybridGraph extends Serializable
object OneGraph extends Serializable
object OneGraphColumn extends Serializable
object PartitionStrategies
object RepresentativeGraph extends Serializable
object ShortestPathsXT extends Serializable

Computes shortest paths to the given set of landmark vertices for temporal graphs treating the graph as undirected
object VEGraph extends Serializable
object VEGraphOptim extends Serializable