Skip to content

Commit 30520a4

Browse files
committed
Fixes graph name in readme.
1 parent 5943bb8 commit 30520a4

File tree

1 file changed

+5
-5
lines changed

1 file changed

+5
-5
lines changed

README.md

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -33,7 +33,7 @@ input_graph.freeze();
3333
let fast_graph = fast_paths::prepare(&input_graph);
3434

3535
// calculate the shortest path between nodes with ID 8 and 6
36-
let shortest_path = fast_paths::calc_path(&fast_path_graph, 8, 6);
36+
let shortest_path = fast_paths::calc_path(&fast_graph, 8, 6);
3737

3838
match shortest_path {
3939
Some(p) => {
@@ -58,15 +58,15 @@ For batch-wise calculation of shortest paths the method described above is ineff
5858
```rust
5959
// ... see above
6060
// create a path calculator (note: not thread-safe, use a separate object per thread)
61-
let mut path_calculator = fast_paths::create_calculator(&fast_path_graph);
62-
let shortest_path = path_calculator.calc_path(&fast_path_graph, 8, 6);
61+
let mut path_calculator = fast_paths::create_calculator(&fast_graph);
62+
let shortest_path = path_calculator.calc_path(&fast_graph, 8, 6);
6363
```
6464

6565
### Saving the prepared graph to disk
6666

6767
```rust
68-
fast_paths::save_to_disk(&fast_path_graph, "fast_path_graph.fp");
69-
let fast_path_graph = fast_paths::load_from_disk("fast_path_graph.fp");
68+
fast_paths::save_to_disk(&fast_graph, "fast_graph.fp");
69+
let fast_graph = fast_paths::load_from_disk("fast_graph.fp");
7070
```
7171

7272
### Preparing the graph after changes

0 commit comments

Comments
 (0)