temporalmapper.layout

Functions

arrange_components(G, component_dict)
best_nearest_neighbor(distances, component)	Try nearest neighbor from each starting point within a component, return the best.
component_ordered_layout(G, x_positions[, ...])
compute_time_semantic_positions(mapper, ...)	Compute node positions
construct_components(G)
find_connected_components(distances)	Find groups of objects that are mutually reachable (finite distances).
force_directed_y_layout(G, x_positions[, ...])	Use force-directed algorithm to find y-positions that minimize crossings X-positions are fixed (time), optimize only y-positions
initial_y_positions(G)
min_path_between_sets(G, set1, set2)
nearest_neighbor_ordering(distances[, start])	Greedy algorithm: always go to the nearest unvisited object.
temporal_barycenter_layout(G, x_positions[, ...])	Barycenter-based layout for edge-crossing minimization with: - adaptive learning rate - momentum - normalization - early stopping
two_opt(distances, path[, max_iterations])	Faster 2-opt using numpy vectorization for distance calculations.