Version Bump

Rust-Dense-Graph/Cargo.lock

@@ -0,0 +1,7 @@
+# This file is automatically @generated by Cargo.
+# It is not intended for manual editing.
+version = 3
+
+[[package]]
+name = "dense_graph"
+version = "0.1.0"

Rust-Dense-Graph/Cargo.toml

@@ -0,0 +1,8 @@
+[package]
+name = "dense_graph"
+version = "0.1.0"
+edition = "2021"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]

Rust-Dense-Graph/ReadMe.md

@@ -0,0 +1,67 @@
+# Graph Implementation with Adjacency Matrix
+
+This project provides a Rust implementation of a graph data structure using an adjacency matrix. The implementation allows you to create, modify, and query properties of a graph, such as adding nodes and edges, removing nodes and edges, and retrieving information about the graph's structure.
+
+## Features
+
+- Node Operations: Add nodes to the graph, remove nodes from the graph, and check if the graph is empty.
+- Edge Operations: Add edges between nodes, remove edges between nodes, and retrieve the weight of edges.
+- Graph Properties: Retrieve the number of nodes and edges in the graph.
+- Clear Graph: Remove all nodes and edges from the graph.
+
+## Usage
+
+To use this graph implementation in your Rust project, follow these steps:
+
+Add the following dependency to your Cargo.toml file:
+
+```toml
+[dependencies]
+graph-adjacency-matrix = "0.1.0"
+```
+
+### Import the Graph struct into your Rust code
+
+```rust
+use graph_adjacency_matrix::Graph;
+```
+
+### Create a new graph
+
+```rust
+let mut graph = Graph::new();
+```
+
+Perform operations such as adding nodes, adding edges, removing nodes, removing edges, and querying graph properties using the methods provided by the Graph struct.
+
+```rust
+// Add nodes
+graph.add_node("A");
+graph.add_node("B");
+
+// Add edges
+graph.add_edge("A", "B", 5);
+
+// Query edge weight
+let weight = graph.get_edge_weight("A", "B").unwrap();
+
+// Remove nodes and edges
+graph.remove_node("A");
+graph.remove_edge("A", "B");
+
+// Check graph properties
+let node_count = graph.node_count();
+let edge_count = graph.edge_count();
+let is_empty = graph.is_empty();
+
+// Clear the graph
+graph.clear();
+```
+
+## Contributing
+
+Contributions to this project are welcome! If you find any issues or have suggestions for improvements, please open an issue or a pull request on the GitHub repository.
+
+## License
+
+This project is licensed under the MIT License. See the LICENSE file for details.

Rust-Dense-Graph/src/dense_graph.rs

@@ -0,0 +1,230 @@
+use std::{
+    collections::HashMap, 
+    hash::Hash
+};
+
+/// Represents a graph using an adjacency matrix.
+#[derive(Debug)]
+pub struct Graph<T> {
+    /// Maps items (vertices) to their corresponding indices in the adjacency matrix.
+    items: HashMap<T, usize>,
+    /// Adjacency matrix representing edges between vertices.
+    adjacency_matrix: Vec<Vec<Option<isize>>>
+}
+
+impl<T: Eq + PartialEq + Hash> Graph<T> {
+    /// Creates a new empty graph.
+    pub fn new() -> Self {
+        Graph { items: HashMap::new(), adjacency_matrix: vec![] }
+    }
+
+    /// Adds a new node (vertex) to the graph.
+    ///
+    /// # Arguments
+    ///
+    /// * `item` - The item (vertex) to add to the graph.
+    ///
+    /// # Example
+    ///
+    /// ```
+    /// let mut g = Graph::new();
+    /// g.add_node("Hello");
+    /// ```
+    pub fn add_node(&mut self, item: T) {
+        self.items.insert(item, self.adjacency_matrix.len());
+        self.adjacency_matrix.push(vec![None; self.items.len().saturating_sub(1)]);
+        for i in 0..self.adjacency_matrix.len() {
+            self.adjacency_matrix[i].push(None);
+        }
+    }
+
+    /// Adds a new edge between two nodes (vertices) in the graph.
+    ///
+    /// # Arguments
+    ///
+    /// * `from` - The source node (vertex) of the edge.
+    /// * `to` - The destination node (vertex) of the edge.
+    /// * `weight` - The weight of the edge.
+    ///
+    /// # Example
+    ///
+    /// ```
+    /// let mut g = Graph::new();
+    /// g.add_edge("NEW", "NEWEST", 10);
+    /// ```
+    pub fn add_edge(&mut self, from: T, to: T, weight: isize) {
+        if let (Some(&from_index), Some(&to_index)) = (self.items.get(&from), self.items.get(&to)) {
+            self.adjacency_matrix[from_index][to_index] = Some(weight);
+            self.adjacency_matrix[to_index][from_index] = Some(weight);
+        }
+    }
+
+    /// Retrieves the weight of the edge between two nodes (vertices) in the graph, if it exists.
+    ///
+    /// # Arguments
+    ///
+    /// * `from` - The source node (vertex) of the edge.
+    /// * `to` - The destination node (vertex) of the edge.
+    ///
+    /// # Returns
+    ///
+    /// The weight of the edge, or `None` if the edge does not exist.
+    ///
+    /// # Example
+    ///
+    /// ```
+    /// let mut g = Graph::new();
+    /// g.add_edge("NEW", "NEWEST", 10);
+    /// assert_eq!(g.get_edge_weight("NEW", "NEWEST"), Some(10));
+    /// ```
+    pub fn get_edge_weight(&self, from: T, to: T) -> Option<isize> {
+        if let (Some(&from_index), Some(&to_index)) = (self.items.get(&from), self.items.get(&to)) {
+            self.adjacency_matrix[from_index][to_index]
+        } else {
+            None
+        }
+    }
+
+    /// Returns a vector containing all the nodes in the graph.
+    pub fn get_nodes(&self) -> Vec<&T> {
+        self.items.keys().collect()
+    }
+
+    /// Given a node, return a vector containing all its neighboring nodes.
+    // pub fn get_neighbors(&self, node: T) -> Option<Vec<&T>> {
+    //     let index = self.items.get(&node)?;
+    //     let neighbors: Vec<&T> = self.adjacency_matrix[*index]
+    //         .iter()
+    //         .enumerate()
+    //         .filter_map(|(i, &weight)| if weight.is_some() { Some(&self.items.get(i)) } else { None })
+    //         .collect();
+    //     Some(neighbors)
+    // }
+
+
+    /// Remove a node from the graph, along with all its incident edges.
+    pub fn remove_node(&mut self, node: T) {
+        if let Some(index) = self.items.remove(&node) {
+            self.adjacency_matrix.remove(index);
+            for row in &mut self.adjacency_matrix {
+                row.remove(index);
+            }
+        }
+    }
+
+
+    /// Remove an edge between two nodes.
+    pub fn remove_edge(&mut self, from: T, to: T) {
+        if let (Some(&from_index), Some(&to_index)) = (self.items.get(&from), self.items.get(&to)) {
+            self.adjacency_matrix[from_index][to_index] = None;
+            self.adjacency_matrix[to_index][from_index] = None;
+        }
+    }
+
+    /// Check if the graph is empty.
+    pub fn is_empty(&self) -> bool {
+        self.items.is_empty()
+    }
+
+    /// Return the number of edges in the graph.
+    pub fn edge_count(&self) -> usize {
+        self.adjacency_matrix.iter().flat_map(|row| row.iter()).filter(|&weight| weight.is_some()).count() / 2
+    }
+
+    /// Return the number of nodes in the graph.
+    pub fn node_count(&self) -> usize {
+        self.items.len()
+    }
+
+    /// Clear the graph, removing all nodes and edges.
+    pub fn clear(&mut self) {
+        self.items.clear();
+        self.adjacency_matrix.clear();
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_add_node() {
+        let mut graph = Graph::new();
+        graph.add_node("A");
+        graph.add_node("B");
+        assert_eq!(graph.node_count(), 2);
+    }
+
+    #[test]
+    fn test_add_edge() {
+        let mut graph = Graph::new();
+        graph.add_node("A");
+        graph.add_node("B");
+        graph.add_edge("A", "B", 5);
+        assert_eq!(graph.edge_count(), 1);
+    }
+
+    #[test]
+    fn test_get_edge_weight() {
+        let mut graph = Graph::new();
+        graph.add_node("A");
+        graph.add_node("B");
+        graph.add_edge("A", "B", 5);
+        assert_eq!(graph.get_edge_weight("A", "B"), Some(5));
+    }
+
+    #[test]
+    fn test_remove_node() {
+        let mut graph = Graph::new();
+        graph.add_node("A");
+        graph.add_node("B");
+        graph.add_edge("A", "B", 5);
+        graph.remove_node("A");
+        assert_eq!(graph.node_count(), 1);
+        assert_eq!(graph.edge_count(), 0);
+    }
+
+    #[test]
+    fn test_remove_edge() {
+        let mut graph = Graph::new();
+        graph.add_node("A");
+        graph.add_node("B");
+        graph.add_edge("A", "B", 5);
+        graph.remove_edge("A", "B");
+        assert_eq!(graph.edge_count(), 0);
+    }
+
+    #[test]
+    fn test_is_empty() {
+        let graph = Graph::<&str>::new();
+        assert!(graph.is_empty());
+    }
+
+    #[test]
+    fn test_edge_count() {
+        let mut graph = Graph::new();
+        graph.add_node("A");
+        graph.add_node("B");
+        graph.add_edge("A", "B", 5);
+        assert_eq!(graph.edge_count(), 1);
+    }
+
+    #[test]
+    fn test_node_count() {
+        let mut graph = Graph::new();
+        graph.add_node("A");
+        graph.add_node("B");
+        assert_eq!(graph.node_count(), 2);
+    }
+
+    #[test]
+    fn test_clear() {
+        let mut graph = Graph::new();
+        graph.add_node("A");
+        graph.add_node("B");
+        graph.add_edge("A", "B", 5);
+        graph.clear();
+        assert_eq!(graph.node_count(), 0);
+        assert_eq!(graph.edge_count(), 0);
+    }
+}

Rust-Dense-Graph/src/main.rs

@@ -0,0 +1,12 @@
+mod dense_graph;
+use dense_graph::Graph;
+
+fn main() {
+    let mut g = Graph::new();
+    g.add_node("Hello");
+    g.add_node("NEW");
+    g.add_node("NEWEST");
+    
+    g.add_edge("NEW", "NEWEST", 10);
+    println!("{g:?}");
+}

Rust-Dense-Graph/src/sparse_graph.rs

@@ -0,0 +1,35 @@
+use std::{collections::HashMap, hash::Hash};
+
+#[derive(Debug, Clone)]
+pub struct Graph<T> {
+    nodes: HashMap<T, Node<T>>,
+    damping: f64,
+}
+
+#[derive(Debug, Clone)]
+pub struct Node<T> {
+    incoming_links: Vec<T>,
+    outgoing_links: Vec<T>,
+    score: f64,
+}
+
+impl<T> Node<T> {
+    pub fn new() -> Self {
+        Node { incoming_links: vec![], outgoing_links: vec![], score: 1.0 }
+    }
+}
+
+impl<T: Hash + Eq + PartialEq + Clone> Graph<T> {
+    pub fn new() -> Self {
+        Graph { nodes: HashMap::new(), damping: 0.85 }
+    }
+
+    pub fn add_page(&mut self, value: T) {
+        self.nodes.insert(value, Node::new());
+    }
+
+    pub fn add_link(&mut self, link: T, page: T) {
+        self.nodes.get_mut(&link).unwrap().incoming_links.push(page.clone());
+        self.nodes.get_mut(&page).unwrap().outgoing_links.push(link);
+    }
+}

Rust-Dense-Graph/target/.rustc_info.json

@@ -0,0 +1 @@
+{"rustc_fingerprint":5506969206366977526,"outputs":{"4614504638168534921":{"success":true,"status":"","code":0,"stdout":"rustc 1.77.2 (25ef9e3d8 2024-04-09)\nbinary: rustc\ncommit-hash: 25ef9e3d85d934b27d9dada2f9dd52b1dc63bb04\ncommit-date: 2024-04-09\nhost: aarch64-apple-darwin\nrelease: 1.77.2\nLLVM version: 17.0.6\n","stderr":""},"15729799797837862367":{"success":true,"status":"","code":0,"stdout":"___\nlib___.rlib\nlib___.dylib\nlib___.dylib\nlib___.a\nlib___.dylib\n/Users/arlo/.rustup/toolchains/stable-aarch64-apple-darwin\noff\npacked\nunpacked\n___\ndebug_assertions\noverflow_checks\npanic=\"unwind\"\nproc_macro\nrelocation_model=\"pic\"\ntarget_abi=\"\"\ntarget_arch=\"aarch64\"\ntarget_endian=\"little\"\ntarget_env=\"\"\ntarget_family=\"unix\"\ntarget_feature=\"aes\"\ntarget_feature=\"crc\"\ntarget_feature=\"dit\"\ntarget_feature=\"dotprod\"\ntarget_feature=\"dpb\"\ntarget_feature=\"dpb2\"\ntarget_feature=\"fcma\"\ntarget_feature=\"fhm\"\ntarget_feature=\"flagm\"\ntarget_feature=\"fp16\"\ntarget_feature=\"frintts\"\ntarget_feature=\"jsconv\"\ntarget_feature=\"lor\"\ntarget_feature=\"lse\"\ntarget_feature=\"neon\"\ntarget_feature=\"paca\"\ntarget_feature=\"pacg\"\ntarget_feature=\"pan\"\ntarget_feature=\"pmuv3\"\ntarget_feature=\"ras\"\ntarget_feature=\"rcpc\"\ntarget_feature=\"rcpc2\"\ntarget_feature=\"rdm\"\ntarget_feature=\"sb\"\ntarget_feature=\"sha2\"\ntarget_feature=\"sha3\"\ntarget_feature=\"ssbs\"\ntarget_feature=\"v8.1a\"\ntarget_feature=\"v8.2a\"\ntarget_feature=\"v8.3a\"\ntarget_feature=\"v8.4a\"\ntarget_feature=\"vh\"\ntarget_has_atomic\ntarget_has_atomic=\"128\"\ntarget_has_atomic=\"16\"\ntarget_has_atomic=\"32\"\ntarget_has_atomic=\"64\"\ntarget_has_atomic=\"8\"\ntarget_has_atomic=\"ptr\"\ntarget_has_atomic_equal_alignment=\"128\"\ntarget_has_atomic_equal_alignment=\"16\"\ntarget_has_atomic_equal_alignment=\"32\"\ntarget_has_atomic_equal_alignment=\"64\"\ntarget_has_atomic_equal_alignment=\"8\"\ntarget_has_atomic_equal_alignment=\"ptr\"\ntarget_has_atomic_load_store\ntarget_has_atomic_load_store=\"128\"\ntarget_has_atomic_load_store=\"16\"\ntarget_has_atomic_load_store=\"32\"\ntarget_has_atomic_load_store=\"64\"\ntarget_has_atomic_load_store=\"8\"\ntarget_has_atomic_load_store=\"ptr\"\ntarget_os=\"macos\"\ntarget_pointer_width=\"64\"\ntarget_thread_local\ntarget_vendor=\"apple\"\nunix\n","stderr":""},"15481046163696847946":{"success":true,"status":"","code":0,"stdout":"___\nlib___.rlib\nlib___.dylib\nlib___.dylib\nlib___.a\nlib___.dylib\n/Users/arlo/.rustup/toolchains/stable-aarch64-apple-darwin\noff\npacked\nunpacked\n___\ndebug_assertions\npanic=\"unwind\"\nproc_macro\ntarget_arch=\"aarch64\"\ntarget_endian=\"little\"\ntarget_env=\"\"\ntarget_family=\"unix\"\ntarget_feature=\"aes\"\ntarget_feature=\"crc\"\ntarget_feature=\"dit\"\ntarget_feature=\"dotprod\"\ntarget_feature=\"dpb\"\ntarget_feature=\"dpb2\"\ntarget_feature=\"fcma\"\ntarget_feature=\"fhm\"\ntarget_feature=\"flagm\"\ntarget_feature=\"fp16\"\ntarget_feature=\"frintts\"\ntarget_feature=\"jsconv\"\ntarget_feature=\"lor\"\ntarget_feature=\"lse\"\ntarget_feature=\"neon\"\ntarget_feature=\"paca\"\ntarget_feature=\"pacg\"\ntarget_feature=\"pan\"\ntarget_feature=\"pmuv3\"\ntarget_feature=\"ras\"\ntarget_feature=\"rcpc\"\ntarget_feature=\"rcpc2\"\ntarget_feature=\"rdm\"\ntarget_feature=\"sb\"\ntarget_feature=\"sha2\"\ntarget_feature=\"sha3\"\ntarget_feature=\"ssbs\"\ntarget_feature=\"vh\"\ntarget_has_atomic=\"128\"\ntarget_has_atomic=\"16\"\ntarget_has_atomic=\"32\"\ntarget_has_atomic=\"64\"\ntarget_has_atomic=\"8\"\ntarget_has_atomic=\"ptr\"\ntarget_os=\"macos\"\ntarget_pointer_width=\"64\"\ntarget_vendor=\"apple\"\nunix\n","stderr":""}},"successes":{}}

Rust-Dense-Graph/target/CACHEDIR.TAG

@@ -0,0 +1,3 @@
+Signature: 8a477f597d28d172789f06886806bc55
+# This file is a cache directory tag created by cargo.
+# For information about cache directory tags see https://bford.info/cachedir/

Rust-Dense-Graph/target/debug/.fingerprint/Rust-Dense-Grahp-197ea2ab2fb061cd/bin-Rust-Dense-Grahp

@@ -0,0 +1 @@
+7fcec897f0bbbf17

Rust-Dense-Graph/target/debug/.fingerprint/Rust-Dense-Grahp-197ea2ab2fb061cd/bin-Rust-Dense-Grahp.json

@@ -0,0 +1 @@
+{"rustc":16006274961074835420,"features":"[]","declared_features":"","target":5498136276376270037,"profile":14400670141151969058,"path":1684066648322511884,"deps":[],"local":[{"CheckDepInfo":{"dep_info":"debug/.fingerprint/Rust-Dense-Grahp-197ea2ab2fb061cd/dep-bin-Rust-Dense-Grahp"}}],"rustflags":[],"metadata":7797948686568424061,"config":2202906307356721367,"compile_kind":0}

Rust-Dense-Graph/target/debug/.fingerprint/Rust-Dense-Grahp-197ea2ab2fb061cd/invoked.timestamp

@@ -0,0 +1 @@
+This file has an mtime of when this was started.

Rust-Dense-Graph/target/debug/.fingerprint/Rust-Dense-Grahp-197ea2ab2fb061cd/output-bin-Rust-Dense-Grahp

@@ -0,0 +1,5 @@
+{"$message_type":"diagnostic","message":"unused variable: `from`","code":{"code":"unused_variables","explanation":null},"level":"warning","spans":[{"file_name":"src/main.rs","byte_start":673,"byte_end":677,"line_start":30,"line_end":30,"column_start":39,"column_end":43,"is_primary":true,"text":[{"text":"    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {","highlight_start":39,"highlight_end":43}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"`#[warn(unused_variables)]` on by default","code":null,"level":"note","spans":[],"children":[],"rendered":null},{"message":"if this is intentional, prefix it with an underscore","code":null,"level":"help","spans":[{"file_name":"src/main.rs","byte_start":673,"byte_end":677,"line_start":30,"line_end":30,"column_start":39,"column_end":43,"is_primary":true,"text":[{"text":"    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {","highlight_start":39,"highlight_end":43}],"label":null,"suggested_replacement":"_from","suggestion_applicability":"MachineApplicable","expansion":null}],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[33mwarning\u001b[0m\u001b[0m\u001b[1m: unused variable: `from`\u001b[0m\n\u001b[0m  \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m--> \u001b[0m\u001b[0msrc/main.rs:30:39\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m30\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\u001b[0m \u001b[0m\u001b[0m    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m| \u001b[0m\u001b[0m                                      \u001b[0m\u001b[0m\u001b[1m\u001b[33m^^^^\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[33mhelp: if this is intentional, prefix it with an underscore: `_from`\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m= \u001b[0m\u001b[0m\u001b[1mnote\u001b[0m\u001b[0m: `#[warn(unused_variables)]` on by default\u001b[0m\n\n"}
+{"$message_type":"diagnostic","message":"unused variable: `to`","code":{"code":"unused_variables","explanation":null},"level":"warning","spans":[{"file_name":"src/main.rs","byte_start":682,"byte_end":684,"line_start":30,"line_end":30,"column_start":48,"column_end":50,"is_primary":true,"text":[{"text":"    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {","highlight_start":48,"highlight_end":50}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"if this is intentional, prefix it with an underscore","code":null,"level":"help","spans":[{"file_name":"src/main.rs","byte_start":682,"byte_end":684,"line_start":30,"line_end":30,"column_start":48,"column_end":50,"is_primary":true,"text":[{"text":"    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {","highlight_start":48,"highlight_end":50}],"label":null,"suggested_replacement":"_to","suggestion_applicability":"MachineApplicable","expansion":null}],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[33mwarning\u001b[0m\u001b[0m\u001b[1m: unused variable: `to`\u001b[0m\n\u001b[0m  \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m--> \u001b[0m\u001b[0msrc/main.rs:30:48\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m30\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\u001b[0m \u001b[0m\u001b[0m    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m| \u001b[0m\u001b[0m                                               \u001b[0m\u001b[0m\u001b[1m\u001b[33m^^\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[33mhelp: if this is intentional, prefix it with an underscore: `_to`\u001b[0m\n\n"}
+{"$message_type":"diagnostic","message":"method `get_edge_weight` is never used","code":{"code":"dead_code","explanation":null},"level":"warning","spans":[{"file_name":"src/main.rs","byte_start":291,"byte_end":307,"line_start":17,"line_end":17,"column_start":1,"column_end":17,"is_primary":false,"text":[{"text":"impl<T> Graph<T> {","highlight_start":1,"highlight_end":17}],"label":"method in this implementation","suggested_replacement":null,"suggestion_applicability":null,"expansion":null},{"file_name":"src/main.rs","byte_start":646,"byte_end":661,"line_start":30,"line_end":30,"column_start":12,"column_end":27,"is_primary":true,"text":[{"text":"    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {","highlight_start":12,"highlight_end":27}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"`#[warn(dead_code)]` on by default","code":null,"level":"note","spans":[],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[33mwarning\u001b[0m\u001b[0m\u001b[1m: method `get_edge_weight` is never used\u001b[0m\n\u001b[0m  \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m--> \u001b[0m\u001b[0msrc/main.rs:30:12\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m17\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\u001b[0m \u001b[0m\u001b[0mimpl<T> Graph<T> {\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m| \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m----------------\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12mmethod in this implementation\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m...\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m30\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\u001b[0m \u001b[0m\u001b[0m    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m| \u001b[0m\u001b[0m           \u001b[0m\u001b[0m\u001b[1m\u001b[33m^^^^^^^^^^^^^^^\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m= \u001b[0m\u001b[0m\u001b[1mnote\u001b[0m\u001b[0m: `#[warn(dead_code)]` on by default\u001b[0m\n\n"}
+{"$message_type":"diagnostic","message":"crate `Rust_Dense_Grahp` should have a snake case name","code":{"code":"non_snake_case","explanation":null},"level":"warning","spans":[{"file_name":"src/main.rs","byte_start":0,"byte_end":0,"line_start":1,"line_end":1,"column_start":1,"column_end":1,"is_primary":true,"text":[],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"convert the identifier to snake case: `rust_dense_grahp`","code":null,"level":"help","spans":[],"children":[],"rendered":null},{"message":"`#[warn(non_snake_case)]` on by default","code":null,"level":"note","spans":[],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[33mwarning\u001b[0m\u001b[0m\u001b[1m: crate `Rust_Dense_Grahp` should have a snake case name\u001b[0m\n\u001b[0m  \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m  \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m= \u001b[0m\u001b[0m\u001b[1mhelp\u001b[0m\u001b[0m: convert the identifier to snake case: `rust_dense_grahp`\u001b[0m\n\u001b[0m  \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m= \u001b[0m\u001b[0m\u001b[1mnote\u001b[0m\u001b[0m: `#[warn(non_snake_case)]` on by default\u001b[0m\n\n"}
+{"$message_type":"diagnostic","message":"4 warnings emitted","code":null,"level":"warning","spans":[],"children":[],"rendered":"\u001b[0m\u001b[1m\u001b[33mwarning\u001b[0m\u001b[0m\u001b[1m: 4 warnings emitted\u001b[0m\n\n"}

Rust-Dense-Graph/target/debug/.fingerprint/Rust-Dense-Grahp-93e1d592b43b0786/bin-Rust-Dense-Grahp

@@ -0,0 +1 @@
+30fb67cdea47a431

Rust-Dense-Graph/target/debug/.fingerprint/Rust-Dense-Grahp-93e1d592b43b0786/bin-Rust-Dense-Grahp.json

@@ -0,0 +1 @@
+{"rustc":16006274961074835420,"features":"[]","declared_features":"","target":5498136276376270037,"profile":14453530908159220714,"path":1684066648322511884,"deps":[],"local":[{"CheckDepInfo":{"dep_info":"debug/.fingerprint/Rust-Dense-Grahp-93e1d592b43b0786/dep-bin-Rust-Dense-Grahp"}}],"rustflags":[],"metadata":7797948686568424061,"config":2202906307356721367,"compile_kind":0}

Rust-Dense-Graph/target/debug/.fingerprint/Rust-Dense-Grahp-93e1d592b43b0786/invoked.timestamp

@@ -0,0 +1 @@
+This file has an mtime of when this was started.

Rust-Dense-Graph/target/debug/.fingerprint/Rust-Dense-Grahp-93e1d592b43b0786/output-bin-Rust-Dense-Grahp

@@ -0,0 +1,5 @@
+{"$message_type":"diagnostic","message":"unused variable: `from`","code":{"code":"unused_variables","explanation":null},"level":"warning","spans":[{"file_name":"src/main.rs","byte_start":673,"byte_end":677,"line_start":30,"line_end":30,"column_start":39,"column_end":43,"is_primary":true,"text":[{"text":"    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {","highlight_start":39,"highlight_end":43}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"`#[warn(unused_variables)]` on by default","code":null,"level":"note","spans":[],"children":[],"rendered":null},{"message":"if this is intentional, prefix it with an underscore","code":null,"level":"help","spans":[{"file_name":"src/main.rs","byte_start":673,"byte_end":677,"line_start":30,"line_end":30,"column_start":39,"column_end":43,"is_primary":true,"text":[{"text":"    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {","highlight_start":39,"highlight_end":43}],"label":null,"suggested_replacement":"_from","suggestion_applicability":"MachineApplicable","expansion":null}],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[33mwarning\u001b[0m\u001b[0m\u001b[1m: unused variable: `from`\u001b[0m\n\u001b[0m  \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m--> \u001b[0m\u001b[0msrc/main.rs:30:39\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m30\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\u001b[0m \u001b[0m\u001b[0m    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m| \u001b[0m\u001b[0m                                      \u001b[0m\u001b[0m\u001b[1m\u001b[33m^^^^\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[33mhelp: if this is intentional, prefix it with an underscore: `_from`\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m= \u001b[0m\u001b[0m\u001b[1mnote\u001b[0m\u001b[0m: `#[warn(unused_variables)]` on by default\u001b[0m\n\n"}
+{"$message_type":"diagnostic","message":"unused variable: `to`","code":{"code":"unused_variables","explanation":null},"level":"warning","spans":[{"file_name":"src/main.rs","byte_start":682,"byte_end":684,"line_start":30,"line_end":30,"column_start":48,"column_end":50,"is_primary":true,"text":[{"text":"    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {","highlight_start":48,"highlight_end":50}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"if this is intentional, prefix it with an underscore","code":null,"level":"help","spans":[{"file_name":"src/main.rs","byte_start":682,"byte_end":684,"line_start":30,"line_end":30,"column_start":48,"column_end":50,"is_primary":true,"text":[{"text":"    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {","highlight_start":48,"highlight_end":50}],"label":null,"suggested_replacement":"_to","suggestion_applicability":"MachineApplicable","expansion":null}],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[33mwarning\u001b[0m\u001b[0m\u001b[1m: unused variable: `to`\u001b[0m\n\u001b[0m  \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m--> \u001b[0m\u001b[0msrc/main.rs:30:48\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m30\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\u001b[0m \u001b[0m\u001b[0m    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m| \u001b[0m\u001b[0m                                               \u001b[0m\u001b[0m\u001b[1m\u001b[33m^^\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[33mhelp: if this is intentional, prefix it with an underscore: `_to`\u001b[0m\n\n"}
+{"$message_type":"diagnostic","message":"method `get_edge_weight` is never used","code":{"code":"dead_code","explanation":null},"level":"warning","spans":[{"file_name":"src/main.rs","byte_start":291,"byte_end":307,"line_start":17,"line_end":17,"column_start":1,"column_end":17,"is_primary":false,"text":[{"text":"impl<T> Graph<T> {","highlight_start":1,"highlight_end":17}],"label":"method in this implementation","suggested_replacement":null,"suggestion_applicability":null,"expansion":null},{"file_name":"src/main.rs","byte_start":646,"byte_end":661,"line_start":30,"line_end":30,"column_start":12,"column_end":27,"is_primary":true,"text":[{"text":"    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {","highlight_start":12,"highlight_end":27}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"`#[warn(dead_code)]` on by default","code":null,"level":"note","spans":[],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[33mwarning\u001b[0m\u001b[0m\u001b[1m: method `get_edge_weight` is never used\u001b[0m\n\u001b[0m  \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m--> \u001b[0m\u001b[0msrc/main.rs:30:12\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m17\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\u001b[0m \u001b[0m\u001b[0mimpl<T> Graph<T> {\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m| \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m----------------\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12mmethod in this implementation\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m...\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m30\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\u001b[0m \u001b[0m\u001b[0m    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m| \u001b[0m\u001b[0m           \u001b[0m\u001b[0m\u001b[1m\u001b[33m^^^^^^^^^^^^^^^\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m= \u001b[0m\u001b[0m\u001b[1mnote\u001b[0m\u001b[0m: `#[warn(dead_code)]` on by default\u001b[0m\n\n"}
+{"$message_type":"diagnostic","message":"crate `Rust_Dense_Grahp` should have a snake case name","code":{"code":"non_snake_case","explanation":null},"level":"warning","spans":[{"file_name":"src/main.rs","byte_start":0,"byte_end":0,"line_start":1,"line_end":1,"column_start":1,"column_end":1,"is_primary":true,"text":[],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"convert the identifier to snake case: `rust_dense_grahp`","code":null,"level":"help","spans":[],"children":[],"rendered":null},{"message":"`#[warn(non_snake_case)]` on by default","code":null,"level":"note","spans":[],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[33mwarning\u001b[0m\u001b[0m\u001b[1m: crate `Rust_Dense_Grahp` should have a snake case name\u001b[0m\n\u001b[0m  \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m  \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m= \u001b[0m\u001b[0m\u001b[1mhelp\u001b[0m\u001b[0m: convert the identifier to snake case: `rust_dense_grahp`\u001b[0m\n\u001b[0m  \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m= \u001b[0m\u001b[0m\u001b[1mnote\u001b[0m\u001b[0m: `#[warn(non_snake_case)]` on by default\u001b[0m\n\n"}
+{"$message_type":"diagnostic","message":"4 warnings emitted","code":null,"level":"warning","spans":[],"children":[],"rendered":"\u001b[0m\u001b[1m\u001b[33mwarning\u001b[0m\u001b[0m\u001b[1m: 4 warnings emitted\u001b[0m\n\n"}

Rust-Dense-Graph/target/debug/.fingerprint/Rust-Dense-Grahp-c8c5bc2a48b36d38/invoked.timestamp

@@ -0,0 +1 @@
+This file has an mtime of when this was started.

Rust-Dense-Graph/target/debug/.fingerprint/Rust-Dense-Grahp-c8c5bc2a48b36d38/output-test-bin-Rust-Dense-Grahp

@@ -0,0 +1,5 @@
+{"$message_type":"diagnostic","message":"unused variable: `from`","code":{"code":"unused_variables","explanation":null},"level":"warning","spans":[{"file_name":"src/main.rs","byte_start":673,"byte_end":677,"line_start":30,"line_end":30,"column_start":39,"column_end":43,"is_primary":true,"text":[{"text":"    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {","highlight_start":39,"highlight_end":43}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"`#[warn(unused_variables)]` on by default","code":null,"level":"note","spans":[],"children":[],"rendered":null},{"message":"if this is intentional, prefix it with an underscore","code":null,"level":"help","spans":[{"file_name":"src/main.rs","byte_start":673,"byte_end":677,"line_start":30,"line_end":30,"column_start":39,"column_end":43,"is_primary":true,"text":[{"text":"    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {","highlight_start":39,"highlight_end":43}],"label":null,"suggested_replacement":"_from","suggestion_applicability":"MachineApplicable","expansion":null}],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[33mwarning\u001b[0m\u001b[0m\u001b[1m: unused variable: `from`\u001b[0m\n\u001b[0m  \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m--> \u001b[0m\u001b[0msrc/main.rs:30:39\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m30\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\u001b[0m \u001b[0m\u001b[0m    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m| \u001b[0m\u001b[0m                                      \u001b[0m\u001b[0m\u001b[1m\u001b[33m^^^^\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[33mhelp: if this is intentional, prefix it with an underscore: `_from`\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m= \u001b[0m\u001b[0m\u001b[1mnote\u001b[0m\u001b[0m: `#[warn(unused_variables)]` on by default\u001b[0m\n\n"}
+{"$message_type":"diagnostic","message":"unused variable: `to`","code":{"code":"unused_variables","explanation":null},"level":"warning","spans":[{"file_name":"src/main.rs","byte_start":682,"byte_end":684,"line_start":30,"line_end":30,"column_start":48,"column_end":50,"is_primary":true,"text":[{"text":"    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {","highlight_start":48,"highlight_end":50}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"if this is intentional, prefix it with an underscore","code":null,"level":"help","spans":[{"file_name":"src/main.rs","byte_start":682,"byte_end":684,"line_start":30,"line_end":30,"column_start":48,"column_end":50,"is_primary":true,"text":[{"text":"    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {","highlight_start":48,"highlight_end":50}],"label":null,"suggested_replacement":"_to","suggestion_applicability":"MachineApplicable","expansion":null}],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[33mwarning\u001b[0m\u001b[0m\u001b[1m: unused variable: `to`\u001b[0m\n\u001b[0m  \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m--> \u001b[0m\u001b[0msrc/main.rs:30:48\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m30\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\u001b[0m \u001b[0m\u001b[0m    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m| \u001b[0m\u001b[0m                                               \u001b[0m\u001b[0m\u001b[1m\u001b[33m^^\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[33mhelp: if this is intentional, prefix it with an underscore: `_to`\u001b[0m\n\n"}
+{"$message_type":"diagnostic","message":"method `get_edge_weight` is never used","code":{"code":"dead_code","explanation":null},"level":"warning","spans":[{"file_name":"src/main.rs","byte_start":291,"byte_end":307,"line_start":17,"line_end":17,"column_start":1,"column_end":17,"is_primary":false,"text":[{"text":"impl<T> Graph<T> {","highlight_start":1,"highlight_end":17}],"label":"method in this implementation","suggested_replacement":null,"suggestion_applicability":null,"expansion":null},{"file_name":"src/main.rs","byte_start":646,"byte_end":661,"line_start":30,"line_end":30,"column_start":12,"column_end":27,"is_primary":true,"text":[{"text":"    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {","highlight_start":12,"highlight_end":27}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"`#[warn(dead_code)]` on by default","code":null,"level":"note","spans":[],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[33mwarning\u001b[0m\u001b[0m\u001b[1m: method `get_edge_weight` is never used\u001b[0m\n\u001b[0m  \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m--> \u001b[0m\u001b[0msrc/main.rs:30:12\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m17\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\u001b[0m \u001b[0m\u001b[0mimpl<T> Graph<T> {\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m| \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m----------------\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12mmethod in this implementation\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m...\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m30\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\u001b[0m \u001b[0m\u001b[0m    pub fn get_edge_weight(&mut self, from: T, to: T) -> Option<isize> {\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m| \u001b[0m\u001b[0m           \u001b[0m\u001b[0m\u001b[1m\u001b[33m^^^^^^^^^^^^^^^\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m= \u001b[0m\u001b[0m\u001b[1mnote\u001b[0m\u001b[0m: `#[warn(dead_code)]` on by default\u001b[0m\n\n"}
+{"$message_type":"diagnostic","message":"crate `Rust_Dense_Grahp` should have a snake case name","code":{"code":"non_snake_case","explanation":null},"level":"warning","spans":[{"file_name":"src/main.rs","byte_start":0,"byte_end":0,"line_start":1,"line_end":1,"column_start":1,"column_end":1,"is_primary":true,"text":[],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"convert the identifier to snake case: `rust_dense_grahp`","code":null,"level":"help","spans":[],"children":[],"rendered":null},{"message":"`#[warn(non_snake_case)]` on by default","code":null,"level":"note","spans":[],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[33mwarning\u001b[0m\u001b[0m\u001b[1m: crate `Rust_Dense_Grahp` should have a snake case name\u001b[0m\n\u001b[0m  \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m  \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m= \u001b[0m\u001b[0m\u001b[1mhelp\u001b[0m\u001b[0m: convert the identifier to snake case: `rust_dense_grahp`\u001b[0m\n\u001b[0m  \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m= \u001b[0m\u001b[0m\u001b[1mnote\u001b[0m\u001b[0m: `#[warn(non_snake_case)]` on by default\u001b[0m\n\n"}
+{"$message_type":"diagnostic","message":"4 warnings emitted","code":null,"level":"warning","spans":[],"children":[],"rendered":"\u001b[0m\u001b[1m\u001b[33mwarning\u001b[0m\u001b[0m\u001b[1m: 4 warnings emitted\u001b[0m\n\n"}

Rust-Dense-Graph/target/debug/.fingerprint/Rust-Dense-Grahp-c8c5bc2a48b36d38/test-bin-Rust-Dense-Grahp

@@ -0,0 +1 @@
+fdae9265a455dd51

Rust-Dense-Graph/target/debug/.fingerprint/Rust-Dense-Grahp-c8c5bc2a48b36d38/test-bin-Rust-Dense-Grahp.json

@@ -0,0 +1 @@
+{"rustc":16006274961074835420,"features":"[]","declared_features":"","target":5498136276376270037,"profile":13957322908208868000,"path":1684066648322511884,"deps":[],"local":[{"CheckDepInfo":{"dep_info":"debug/.fingerprint/Rust-Dense-Grahp-c8c5bc2a48b36d38/dep-test-bin-Rust-Dense-Grahp"}}],"rustflags":[],"metadata":7797948686568424061,"config":2202906307356721367,"compile_kind":0}

Rust-Dense-Graph/target/debug/.fingerprint/dense_graph-42a9704095f8f8cc/bin-dense_graph

@@ -0,0 +1 @@
+8e996ee510c10b4f

Rust-Dense-Graph/target/debug/.fingerprint/dense_graph-42a9704095f8f8cc/bin-dense_graph.json

@@ -0,0 +1 @@
+{"rustc":16006274961074835420,"features":"[]","declared_features":"","target":4736413325223644982,"profile":14400670141151969058,"path":1684066648322511884,"deps":[],"local":[{"CheckDepInfo":{"dep_info":"debug/.fingerprint/dense_graph-42a9704095f8f8cc/dep-bin-dense_graph"}}],"rustflags":[],"metadata":7797948686568424061,"config":2202906307356721367,"compile_kind":0}

Rust-Dense-Graph/target/debug/.fingerprint/dense_graph-42a9704095f8f8cc/invoked.timestamp

@@ -0,0 +1 @@
+This file has an mtime of when this was started.

Rust-Dense-Graph/target/debug/.fingerprint/dense_graph-51db6d1db861b653/invoked.timestamp

@@ -0,0 +1 @@
+This file has an mtime of when this was started.

Rust-Dense-Graph/target/debug/.fingerprint/dense_graph-51db6d1db861b653/output-test-bin-dense_graph

@@ -0,0 +1,2 @@
+{"$message_type":"diagnostic","message":"method `get_nodes` is never used","code":{"code":"dead_code","explanation":null},"level":"warning","spans":[{"file_name":"src/dense_graph.rs","byte_start":373,"byte_end":412,"line_start":15,"line_end":15,"column_start":1,"column_end":40,"is_primary":false,"text":[{"text":"impl<T: Eq + PartialEq + Hash> Graph<T> {","highlight_start":1,"highlight_end":40}],"label":"method in this implementation","suggested_replacement":null,"suggestion_applicability":null,"expansion":null},{"file_name":"src/dense_graph.rs","byte_start":2746,"byte_end":2755,"line_start":89,"line_end":89,"column_start":12,"column_end":21,"is_primary":true,"text":[{"text":"    pub fn get_nodes(&self) -> Vec<&T> {","highlight_start":12,"highlight_end":21}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"`#[warn(dead_code)]` on by default","code":null,"level":"note","spans":[],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[33mwarning\u001b[0m\u001b[0m\u001b[1m: method `get_nodes` is never used\u001b[0m\n\u001b[0m  \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m--> \u001b[0m\u001b[0msrc/dense_graph.rs:89:12\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m15\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\u001b[0m \u001b[0m\u001b[0mimpl<T: Eq + PartialEq + Hash> Graph<T> {\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m| \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m---------------------------------------\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12mmethod in this implementation\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m...\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m89\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\u001b[0m \u001b[0m\u001b[0m    pub fn get_nodes(&self) -> Vec<&T> {\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m| \u001b[0m\u001b[0m           \u001b[0m\u001b[0m\u001b[1m\u001b[33m^^^^^^^^^\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m= \u001b[0m\u001b[0m\u001b[1mnote\u001b[0m\u001b[0m: `#[warn(dead_code)]` on by default\u001b[0m\n\n"}
+{"$message_type":"diagnostic","message":"1 warning emitted","code":null,"level":"warning","spans":[],"children":[],"rendered":"\u001b[0m\u001b[1m\u001b[33mwarning\u001b[0m\u001b[0m\u001b[1m: 1 warning emitted\u001b[0m\n\n"}

Rust-Dense-Graph/target/debug/.fingerprint/dense_graph-51db6d1db861b653/test-bin-dense_graph

@@ -0,0 +1 @@
+8619ce784969e28c

Rust-Dense-Graph/target/debug/.fingerprint/dense_graph-51db6d1db861b653/test-bin-dense_graph.json

@@ -0,0 +1 @@
+{"rustc":16006274961074835420,"features":"[]","declared_features":"","target":4736413325223644982,"profile":13957322908208868000,"path":1684066648322511884,"deps":[],"local":[{"CheckDepInfo":{"dep_info":"debug/.fingerprint/dense_graph-51db6d1db861b653/dep-test-bin-dense_graph"}}],"rustflags":[],"metadata":7797948686568424061,"config":2202906307356721367,"compile_kind":0}

Rust-Dense-Graph/target/debug/.fingerprint/dense_graph-975875425056eea7/invoked.timestamp

@@ -0,0 +1 @@
+This file has an mtime of when this was started.

Rust-Dense-Graph/target/debug/.fingerprint/dense_graph-975875425056eea7/output-test-bin-dense_graph

@@ -0,0 +1,2 @@
+{"$message_type":"diagnostic","message":"method `get_nodes` is never used","code":{"code":"dead_code","explanation":null},"level":"warning","spans":[{"file_name":"src/dense_graph.rs","byte_start":362,"byte_end":401,"line_start":12,"line_end":12,"column_start":1,"column_end":40,"is_primary":false,"text":[{"text":"impl<T: Eq + PartialEq + Hash> Graph<T> {","highlight_start":1,"highlight_end":40}],"label":"method in this implementation","suggested_replacement":null,"suggestion_applicability":null,"expansion":null},{"file_name":"src/dense_graph.rs","byte_start":2735,"byte_end":2744,"line_start":86,"line_end":86,"column_start":12,"column_end":21,"is_primary":true,"text":[{"text":"    pub fn get_nodes(&self) -> Vec<&T> {","highlight_start":12,"highlight_end":21}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"`#[warn(dead_code)]` on by default","code":null,"level":"note","spans":[],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[33mwarning\u001b[0m\u001b[0m\u001b[1m: method `get_nodes` is never used\u001b[0m\n\u001b[0m  \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m--> \u001b[0m\u001b[0msrc/dense_graph.rs:86:12\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m12\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\u001b[0m \u001b[0m\u001b[0mimpl<T: Eq + PartialEq + Hash> Graph<T> {\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m| \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m---------------------------------------\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12mmethod in this implementation\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m...\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;12m86\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\u001b[0m \u001b[0m\u001b[0m    pub fn get_nodes(&self) -> Vec<&T> {\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m| \u001b[0m\u001b[0m           \u001b[0m\u001b[0m\u001b[1m\u001b[33m^^^^^^^^^\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m|\u001b[0m\n\u001b[0m   \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;12m= \u001b[0m\u001b[0m\u001b[1mnote\u001b[0m\u001b[0m: `#[warn(dead_code)]` on by default\u001b[0m\n\n"}
+{"$message_type":"diagnostic","message":"1 warning emitted","code":null,"level":"warning","spans":[],"children":[],"rendered":"\u001b[0m\u001b[1m\u001b[33mwarning\u001b[0m\u001b[0m\u001b[1m: 1 warning emitted\u001b[0m\n\n"}

Rust-Dense-Graph/target/debug/.fingerprint/dense_graph-975875425056eea7/test-bin-dense_graph

@@ -0,0 +1 @@
+8feffbc8040be930

Rust-Dense-Graph/target/debug/.fingerprint/dense_graph-975875425056eea7/test-bin-dense_graph.json

@@ -0,0 +1 @@
+{"rustc":16006274961074835420,"features":"[]","declared_features":"","target":4736413325223644982,"profile":14111625774820709693,"path":1684066648322511884,"deps":[],"local":[{"CheckDepInfo":{"dep_info":"debug/.fingerprint/dense_graph-975875425056eea7/dep-test-bin-dense_graph"}}],"rustflags":[],"metadata":7797948686568424061,"config":2202906307356721367,"compile_kind":0}

Rust-Dense-Graph/target/debug/.fingerprint/dense_graph-d43708bb9418f0e2/bin-dense_graph

@@ -0,0 +1 @@
+5585c45bb3f71abe

Rust-Dense-Graph/target/debug/.fingerprint/dense_graph-d43708bb9418f0e2/bin-dense_graph.json

@@ -0,0 +1 @@
+{"rustc":16006274961074835420,"features":"[]","declared_features":"","target":4736413325223644982,"profile":14453530908159220714,"path":1684066648322511884,"deps":[],"local":[{"CheckDepInfo":{"dep_info":"debug/.fingerprint/dense_graph-d43708bb9418f0e2/dep-bin-dense_graph"}}],"rustflags":[],"metadata":7797948686568424061,"config":2202906307356721367,"compile_kind":0}

Rust-Dense-Graph/target/debug/.fingerprint/dense_graph-d43708bb9418f0e2/invoked.timestamp

@@ -0,0 +1 @@
+This file has an mtime of when this was started.

Rust-Dense-Graph/target/debug/Rust-Dense-Grahp.d

@@ -0,0 +1 @@
+/Users/arlo/Code/Algorithms-and-Datastructures/Rust-Dense-Graph/target/debug/Rust-Dense-Grahp: /Users/arlo/Code/Algorithms-and-Datastructures/Rust-Dense-Graph/src/main.rs

Rust-Dense-Graph/target/debug/dense_graph.d

@@ -0,0 +1 @@
+/Users/arlo/Code/Algorithms-and-Datastructures/Rust-Dense-Graph/target/debug/dense_graph: /Users/arlo/Code/Algorithms-and-Datastructures/Rust-Dense-Graph/src/dense_graph.rs /Users/arlo/Code/Algorithms-and-Datastructures/Rust-Dense-Graph/src/main.rs

Rust-Dense-Graph/target/debug/deps/Rust_Dense_Grahp-197ea2ab2fb061cd.d

@@ -0,0 +1,5 @@
+/Users/arlo/Code/Algorithms-and-Datastructures/Rust-Dense-Graph/target/debug/deps/libRust_Dense_Grahp-197ea2ab2fb061cd.rmeta: src/main.rs
+
+/Users/arlo/Code/Algorithms-and-Datastructures/Rust-Dense-Graph/target/debug/deps/Rust_Dense_Grahp-197ea2ab2fb061cd.d: src/main.rs
+
+src/main.rs:

Rust-Dense-Graph/target/debug/deps/Rust_Dense_Grahp-93e1d592b43b0786.d

@@ -0,0 +1,5 @@
+/Users/arlo/Code/Algorithms-and-Datastructures/Rust-Dense-Graph/target/debug/deps/Rust_Dense_Grahp-93e1d592b43b0786: src/main.rs
+
+/Users/arlo/Code/Algorithms-and-Datastructures/Rust-Dense-Graph/target/debug/deps/Rust_Dense_Grahp-93e1d592b43b0786.d: src/main.rs
+
+src/main.rs:

Rust-Dense-Graph/target/debug/deps/Rust_Dense_Grahp-c8c5bc2a48b36d38.d

@@ -0,0 +1,5 @@
+/Users/arlo/Code/Algorithms-and-Datastructures/Rust-Dense-Graph/target/debug/deps/libRust_Dense_Grahp-c8c5bc2a48b36d38.rmeta: src/main.rs
+
+/Users/arlo/Code/Algorithms-and-Datastructures/Rust-Dense-Graph/target/debug/deps/Rust_Dense_Grahp-c8c5bc2a48b36d38.d: src/main.rs
+
+src/main.rs:

Rust-Dense-Graph/target/debug/deps/dense_graph-42a9704095f8f8cc.d

@@ -0,0 +1,6 @@
+/Users/arlo/Code/Algorithms-and-Datastructures/Rust-Dense-Graph/target/debug/deps/libdense_graph-42a9704095f8f8cc.rmeta: src/main.rs src/dense_graph.rs
+
+/Users/arlo/Code/Algorithms-and-Datastructures/Rust-Dense-Graph/target/debug/deps/dense_graph-42a9704095f8f8cc.d: src/main.rs src/dense_graph.rs
+
+src/main.rs:
+src/dense_graph.rs:

Rust-Dense-Graph/target/debug/deps/dense_graph-51db6d1db861b653.d

@@ -0,0 +1,6 @@
+/Users/arlo/Code/Algorithms-and-Datastructures/Rust-Dense-Graph/target/debug/deps/libdense_graph-51db6d1db861b653.rmeta: src/main.rs src/dense_graph.rs
+
+/Users/arlo/Code/Algorithms-and-Datastructures/Rust-Dense-Graph/target/debug/deps/dense_graph-51db6d1db861b653.d: src/main.rs src/dense_graph.rs
+
+src/main.rs:
+src/dense_graph.rs: