📝 Updated docs

Author: zeon256

src/lib.rs

@@ -183,6 +183,7 @@ where
 
 /// This trait represents the kind of containers that is required for a particular algorithm to function
 #[cfg(feature="traits")]
+#[cfg_attr(docsrs, doc(cfg(feature = "traits")))]
 pub trait AlgorithmContainer {
     /// Any kind of contiguous container
     /// 
@@ -202,6 +203,7 @@ pub trait AlgorithmContainer {
 
 /// Union operation
 #[cfg(feature="traits")]
+#[cfg_attr(docsrs, doc(cfg(feature = "traits")))]
 pub trait Union<T>
 where
     T: VertexType,
@@ -216,6 +218,7 @@ where
 
 /// Find operation
 #[cfg(feature="traits")]
+#[cfg_attr(docsrs, doc(cfg(feature = "traits")))]
 pub trait Find<T>
 where
     T: VertexType,
@@ -225,6 +228,7 @@ where
 
 /// Connected operation
 #[cfg(feature="traits")]
+#[cfg_attr(docsrs, doc(cfg(feature = "traits")))]
 pub trait Connected<T>
 where
     T: VertexType,

src/quickunion.rs

@@ -18,6 +18,7 @@ pub struct Unweighted<const IS_SLICE: bool = false>;
 
 /// Heuristic for quick union algorithm
 #[cfg(feature = "traits")]
+#[cfg_attr(docsrs, doc(cfg(feature = "traits")))]
 pub trait Heuristic {
     fn handle_decision<T>(
         a: T::IdentifierType,