| 4 | use crate::ll::LinkedList; |
| 5 | |
| 6 | pub struct Digraph { |
| 7 | nv: usize, // num of vertices |
| 8 | ne: usize, // num of edges |
| 9 | adj: Vec<LinkedList<usize>>, |
| 10 | } |
| 11 | |
| 12 | impl IGraph for Digraph { |
| 13 | fn V(&self) -> usize { |
nothing calls this directly
no outgoing calls
no test coverage detected