| 5 | use crate::ll::LinkedList; |
| 6 | |
| 7 | pub struct EWDigraph { |
| 8 | nv: usize, // number of vertices in this digraph |
| 9 | ne: usize, // number of edges in this digraph |
| 10 | adj: Vec<LinkedList<DirectedEdge>>, // adj[v] = adjacency list for vertex v |
| 11 | in_degree: Vec<usize>, // in_degree[v] = in degree of vertex v |
| 12 | } |
| 13 | |
| 14 | impl IEWDigraph for EWDigraph { |
| 15 | fn V(&self) -> usize { |
nothing calls this directly
no outgoing calls
no test coverage detected