chore: add examples

Cargo.toml

@@ -6,7 +6,7 @@ edition = "2021"
 license = "MIT"
 readme = "README.md"
 authors = ["Slavik Pastushenko <slavpas@gmail.com>"]
-exclude = [".github/**"]
+exclude = [".github/**", "examples/**"]
 documentation = "https://docs.rs/graph-algorithms-rs"
 repository = "https://github.com/slavik-pastushenko/graph-algorithms-rs"
 

README.md

@@ -38,6 +38,14 @@ The Floyd-Warshall algorithm finds shortest paths between all pairs of vertices
 
 This crate uses `#![forbid(unsafe_code)]` to ensure everything is implemented in 100% safe Rust.
 
+## Usage
+
+The `examples` directory contains example implementations of various graph algorithms:
+
+```rust
+use graph_algorithms::{Dijkstra, GraphAlgorithm};
+```
+
 ## Contributing
 
 Build the application:

examples/Cargo.toml

@@ -0,0 +1,7 @@
+[package]
+name = "dijkstra"
+version = "0.1.0"
+edition = "2021"
+
+[dependencies]
+graph-algorithms-rs = { path = "../" }

examples/src/dijkstra.rs

@@ -0,0 +1,14 @@
+use graph_algorithms::{Dijkstra, GraphAlgorithm};
+
+pub fn run() {
+    let mut dijkstra = Dijkstra::new();
+    dijkstra.set_nodes(vec![
+        (0, vec![(1, 1), (2, 4)]),
+        (1, vec![(2, 2)]),
+        (2, vec![]),
+    ]);
+
+    let result = dijkstra.run(0);
+
+    println!("{:?}", result);
+}

examples/src/main.rs

@@ -0,0 +1,6 @@
+mod dijkstra;
+
+fn main() {
+    // Run the Dijkstra example
+    dijkstra::run();
+}