27 lines
831 B
Rust
27 lines
831 B
Rust
pub trait EdgeTrait<N> {
|
|
fn target(&self) -> N;
|
|
}
|
|
|
|
pub trait Graph<'a> {
|
|
type Node;
|
|
type Edge: EdgeTrait<Self::Node>;
|
|
type NodesIter: Iterator<Item = Self::Node> + 'a;
|
|
type EdgesIter: Iterator<Item = Self::Edge> + 'a;
|
|
|
|
fn nodes(&'a self) -> Self::NodesIter;
|
|
fn out_edges(&'a self, u: &Self::Node) -> Self::EdgesIter;
|
|
fn in_edges(&'a self, u: &Self::Node) -> Self::EdgesIter;
|
|
|
|
fn out_neighbors(&'a self, u: &Self::Node) -> Box<dyn Iterator<Item = Self::Node>> {
|
|
Box::new(self.out_edges(u).map(|e| e.target()))
|
|
//~^ ERROR lifetime may not live long enough
|
|
}
|
|
|
|
fn in_neighbors(&'a self, u: &Self::Node) -> Box<dyn Iterator<Item = Self::Node>> {
|
|
Box::new(self.in_edges(u).map(|e| e.target()))
|
|
//~^ ERROR lifetime may not live long enough
|
|
}
|
|
}
|
|
|
|
fn main() {}
|