Struct Graph 

pub struct Graph { /* private fields */ }

Qo’shnilik ro’yxati (adjacency list) asosidagi graf.

Tugunlar 0..n butun sonlar bilan raqamlanadi. Nomlar bilan ishlash kerak bo’lsa, HashMap<String, usize> orqali nomni indeksga bog’lang.

Misol

use rust_algorithms::graph::Graph;

// yo'naltirilmagan, og'irlikli graf
let mut g = Graph::new_undirected(4);
g.add_edge(0, 1, 5);
g.add_edge(0, 2, 2);
g.add_edge(2, 3, 1);

assert_eq!(g.node_count(), 4);
assert_eq!(g.edge_count(), 3);
assert_eq!(g.degree(0), 2);
assert!(g.has_edge(1, 0)); // yo'naltirilmagan — ikki tomonlama

Implementations

impl Graph

pub fn new_undirected(n: usize) -> Self

n tugunli yo’naltirilmagan graf (qirra ikki tomonga ham ishlaydi).

pub fn new_directed(n: usize) -> Self

n tugunli yo’naltirilgan graf (qirra faqat bir tomonga).

pub fn add_edge(&mut self, from: usize, to: usize, weight: i64)

Og’irlikli qirra qo’shadi.

Panics

from yoki to tugun sonidan katta bo’lsa.

pub fn add_unweighted_edge(&mut self, from: usize, to: usize)

Og’irliksiz qirra (og’irligi 1).

pub fn neighbors(&self, node: usize) -> &[Edge]

Tugunning qo’shnilari.

pub fn has_edge(&self, from: usize, to: usize) -> bool

from → to qirra bormi?

pub fn degree(&self, node: usize) -> usize

Tugunning darajasi (chiquvchi qirralar soni).

pub fn node_count(&self) -> usize

Tugunlar soni.

pub fn edge_count(&self) -> usize

Qirralar soni (yo’naltirilmaganda juftlik bir marta sanaladi).

pub fn is_directed(&self) -> bool

Graf yo’naltirilganmi?

pub fn all_edges(&self) -> Vec<(usize, usize, i64)>

Barcha qirralar (from, to, weight) ko’rinishida. Yo’naltirilmagan grafda har juftlik bir marta (from < to) qaytadi.

pub fn reversed(&self) -> Graph

Qirralar yo’nalishi teskari qilingan yangi graf (yo’naltirilgan graflar uchun).

Kosaraju algoritmi va “kim menga bog’liq?” tipidagi savollarda kerak.

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Graph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.