refactor(tree): Be more specific edges is filtered

Author: epage

src/cargo/ops/tree/graph.rs

@@ -131,7 +131,7 @@ impl<'a> Graph<'a> {
     }
 
     /// Returns a list of nodes the given node index points to for the given kind.
-    pub fn edges(&self, from: usize, kind: &EdgeKind) -> Vec<Edge> {
+    pub fn edges_of_kind(&self, from: usize, kind: &EdgeKind) -> Vec<Edge> {
         let edges = self.edges[from].of_kind(kind);
         // Created a sorted list for consistent output.
         let mut edges = edges.to_owned();

src/cargo/ops/tree/mod.rs

@@ -383,7 +383,7 @@ fn print_dependencies<'a>(
     print_stack: &mut Vec<usize>,
     kind: &EdgeKind,
 ) {
-    let deps = graph.edges(node_index, kind);
+    let deps = graph.edges_of_kind(node_index, kind);
     if deps.is_empty() {
         return;
     }