hierarchical_pathfinding 0.3.6

A crate to quickly approximate Paths on a Grid.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44

//! A Module for generic implementations.
//!
//! This Module is primarily used as the internal Library Backend for the actual implementations in the other Modules.
//! You may use the provided functionality for other purposes,
//! but it is recommended to use implementations from other Crates instead.

mod path;
pub use self::path::Path;

/// Implementation of A* and Dijkstra for Grids
pub mod grid {
	mod a_star;
	pub use self::a_star::a_star_search;

	mod dijkstra;
	pub use self::dijkstra::dijkstra_search;
}

/// Implementation of A* and Dijkstra for Graphs
pub mod graph {
	mod a_star;
	pub use self::a_star::a_star_search;

	mod dijkstra;
	pub use self::dijkstra::dijkstra_search;
}

/// a Type to represent the Cost of traversing a Node
pub type Cost = usize;

fn ordered_insert<T, V, F>(vector: &mut Vec<T>, element: T, mut get_value: F)
where
	V: Ord,
	F: FnMut(&T) -> V,
{
	let value = get_value(&element);
	for i in 0..vector.len() {
		if get_value(&vector[i]) <= value {
			vector.insert(i, element);
			return;
		}
	}
	vector.push(element);
}