god-graph 0.6.0-alpha

A graph-based LLM white-box optimization toolbox: topology validation, Lie group orthogonalization, tensor ring compression
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

//! 邻接表格式导出

use crate::graph::traits::GraphQuery;
use crate::graph::Graph;
use std::fmt::Write;

/// 将图导出为邻接表格式字符串
pub fn to_adjacency_list<T, E>(graph: &Graph<T, E>) -> String
where
    T: std::fmt::Display,
{
    let mut output = String::new();

    for node in graph.nodes() {
        write!(&mut output, "{}:", node.data()).unwrap();
        for neighbor in graph.neighbors(node.index()) {
            write!(&mut output, " {}", neighbor.index()).unwrap();
        }
        writeln!(&mut output).unwrap();
    }

    output
}