Struct algorithms_fourth::digraph::depth_first_order::DepthFirstOrder

pub struct DepthFirstOrder { /* private fields */ }

用法

use algorithms_fourth::digraph::Digraph;
use algorithms_fourth::digraph::depth_first_order::DepthFirstOrder;
let mut g = Digraph::new(4);
g.add_edge(0, 1);
g.add_edge(2, 3);
let dfo = DepthFirstOrder::new(&g);
assert_eq!(dfo.post(),vec![1,0,3,2]);
assert_eq!(dfo.pre(),vec![0,1,2,3]);
assert_eq!(dfo.reverse_post(),vec![1,0,3,2]);

Implementations

impl DepthFirstOrder

pub fn new(g: &Digraph) -> Self

pub fn pre(&self) -> Vec<usize>

所有顶点的前序排列

pub fn post(&self) -> Vec<usize>

所有顶点的后序排列

pub fn reverse_post(&self) -> Vec<usize>

所有顶点的逆后序排列

使用

use algorithms_fourth::digraph::Digraph;
use algorithms_fourth::digraph::depth_first_order::DepthFirstOrder;
let mut g = Digraph::new(4);
g.add_edge(0, 1);
g.add_edge(2, 3);
let dfo = DepthFirstOrder::new(&g);
assert_eq!(dfo.reverse_post(),vec![1,0,3,2]);
   
   let mut points = dfo.reverse_post();
   while let Some(s) = points.pop() {
        println!("{}",s);    
}