/// The maximum graph distance between two vertices in an orbit
/// Normally every two-vertex pair should be considered.
/// As the orbit is resulted from givp process, we only consider the distances between the first vertex and the other vertices
The maximum graph distance between two vertices in an orbit
Normally every two-vertex pair should be considered.
As the orbit is resulted from givp process, we only consider the distances between the first vertex and the other vertices
The maximum graph distance between two vertices in an orbit Normally every two - vertex pair should be considered . As the orbit is resulted from givp process we only consider the distances between the first vertex and the other vertices
fn max_graph_distance_inside_orbit<T: core::graph::Vertex>(
    orbit: &Vec<usize>,
    vv: &core::graph::VertexVec<T>
) -> usize {
    let mut distance: usize = 0;
    for idx in 1..orbit.len() {
        let distance_tmp: usize = core::graph_ops::graph_distance(orbit[0], orbit[idx], vv);
        if distance_tmp > distance {
            distance = distance_tmp;
        }
    }
    distance
}
fn max_graph_distance_inside_orbit < T : core :: graph :: Vertex > ( orbit : & Vec < usize > , vv : & core :: graph :: VertexVec < T > ) -> usize { let mut distance : usize = 0 ; for idx in 1 .. orbit . len ( ) { let distance_tmp : usize = core :: graph_ops :: graph_distance ( orbit [ 0 ] , orbit [ idx ] , vv ) ; if distance_tmp > distance { distance = distance_tmp ; } } distance }
The maximum graph distance between two vertices in an orbit
Normally every two-vertex pair should be considered.
The maximum graph distance between two vertices in an orbit Normally every two - vertex pair should be considered .
orbit
&Vec<usize>
vv
&core::graph::VertexVec<T>