pub fn simple_spanning_tree<V: AsRef<[f32]>>(scores: &[V]) -> Vec<usize> {
    // TODO(chantera): implement
    let _ = scores;
    vec![]
}
/// Finds a dependency tree by a greedy spanning tree algorithm
///
/// The tree is wellformed by iteratively identifying and fixing cycles for each proposed root
/// and selecting the one with the highest score.
///
/// References:
/// - http://aclweb.org/anthology/K17-3002
/// - https://github.com/tdozat/Parser-v2/blob/6229befd7ab72565569d9f8aaa98401e8112971d/parser/misc/mst.py
///
/// scores: 2D array [dependents, heads]
Finds a dependency tree by a greedy spanning tree algorithm
The tree is wellformed by iteratively identifying and fixing cycles for each proposed root
and selecting the one with the highest score.



2D array [dependents, heads]
Finds a dependency tree by a greedy spanning tree algorithm The tree is wellformed by iteratively identifying and fixing cycles for each proposed root and selecting the one with the highest score . 2D array [ dependents heads ]
pub fn simple_spanning_tree<V: AsRef<[f32]>>(scores: &[V]) -> Vec<usize> {
    // TODO(chantera): implement
    let _ = scores;
    vec![]
}
pub fn simple_spanning_tree < V : AsRef < [ f32 ] > > ( scores : & [ V ] ) -> Vec < usize > { // TODO(chantera): implement let _ = scores ; vec ! [ ] }
Finds a dependency tree by a greedy spanning tree algorithm
The tree is wellformed by iteratively identifying and fixing cycles for each proposed root
and selecting the one with the highest score.
Finds a dependency tree by a greedy spanning tree algorithm The tree is wellformed by iteratively identifying and fixing cycles for each proposed root and selecting the one with the highest score .
scores
&[V]
scores
&[V]