/**
 * Produce a distance matrix from an input graph, tracing distances from each node to every node specified in target vector
 * @see "A Fast Algorithm to Find All-Pairs Shortest Paths in Complex Networks" by Wei Peng et Al. 2012
 * @template T
 * @param {Graph<T>} graph
 * @param {T[]} node_array graph nodes as an array
 * @param {number[]} targets node indices, distances to which need to be calculated
 * @param {Map<T, number>} node_index_map
 * @returns {SquareMatrix}
 */
export function graph_compute_distance_matrix<T>(graph: Graph<T>, node_array: T[], targets: number[], node_index_map: Map<T, number>): SquareMatrix;
import { SquareMatrix } from "../math/matrix/SquareMatrix.js";
//# sourceMappingURL=graph_compute_distance_matrix.d.ts.map