pub struct WeightedGraph {
    adjacency_list: HashMap<i32, Vec<(i32, i32)>>,
}

Fields§

§adjacency_list: HashMap<i32, Vec<(i32, i32)>>

Implementations§

source§

impl WeightedGraph

source

fn new() -> Self

source

fn add_edge(&mut self, from_node: i32, to_node: i32, weight: i32)

Add an edge to the graph

Args: from_node (int): The source node to_node (int): The destination node weight (int): The weight of the edge

source

fn dijkstra(&self, start: i32, end: i32) -> PyResult<(i32, Vec<i32>)>

Find the shortest path using Dijkstra’s algorithm

Args: start (int): The starting node end (int): The ending node

Returns: tuple: A tuple containing the total cost and the path (as a list of nodes)

source

fn bellman_ford(&self, start: i32, end: i32) -> PyResult<(i32, Vec<i32>)>

Find the shortest path using Bellman-Ford algorithm

Args: start (int): The starting node end (int): The ending node

Returns: tuple: A tuple containing the total cost and the path (as a list of nodes)

source

fn prim(&self) -> PyResult<Vec<(i32, i32, i32)>>

Find the Minimum Spanning Tree using Prim’s algorithm

Returns: list: A list of tuples representing the edges in the MST (from_node, to_node, weight)

source

fn kruskal(&self) -> PyResult<Vec<(i32, i32, i32)>>

Find the Minimum Spanning Tree using Kruskal’s algorithm

Returns: list: A list of tuples representing the edges in the MST (from_node, to_node, weight)

source

fn ford_fulkerson(&mut self, source: i32, sink: i32) -> PyResult<i32>

Find the maximum flow using Ford-Fulkerson algorithm

Args: source (int): The source node sink (int): The sink node

Returns: int: The maximum flow from source to sink

source

fn bfs_find_path(&self, source: i32, sink: i32) -> (Vec<i32>, i32)

Trait Implementations§

source§

impl HasPyGilRef for WeightedGraph

§

type AsRefTarget = PyCell<WeightedGraph>

Utility type to make Py::as_ref work.
source§

impl IntoPy<Py<PyAny>> for WeightedGraph

source§

fn into_py(self, py: Python<'_>) -> PyObject

Performs the conversion.
source§

impl PyClass for WeightedGraph

§

type Frozen = False

Whether the pyclass is frozen. Read more
source§

impl PyClassImpl for WeightedGraph

source§

const IS_BASETYPE: bool = false

#[pyclass(subclass)]
source§

const IS_SUBCLASS: bool = false

#[pyclass(extends=…)]
source§

const IS_MAPPING: bool = false

#[pyclass(mapping)]
source§

const IS_SEQUENCE: bool = false

#[pyclass(sequence)]
§

type BaseType = PyAny

Base class
§

type ThreadChecker = SendablePyClass<WeightedGraph>

This handles following two situations: Read more
§

type PyClassMutability = <<PyAny as PyClassBaseType>::PyClassMutability as PyClassMutability>::MutableChild

Immutable or mutable
§

type Dict = PyClassDummySlot

Specify this class has #[pyclass(dict)] or not.
§

type WeakRef = PyClassDummySlot

Specify this class has #[pyclass(weakref)] or not.
§

type BaseNativeType = PyAny

The closest native ancestor. This is PyAny by default, and when you declare #[pyclass(extends=PyDict)], it’s PyDict.
source§

fn items_iter() -> PyClassItemsIter

source§

fn doc(py: Python<'_>) -> PyResult<&'static CStr>

Rendered class doc
source§

fn lazy_type_object() -> &'static LazyTypeObject<Self>

source§

fn dict_offset() -> Option<isize>

source§

fn weaklist_offset() -> Option<isize>

source§

impl PyClassNewTextSignature<WeightedGraph> for PyClassImplCollector<WeightedGraph>

source§

fn new_text_signature(self) -> Option<&'static str>

source§

impl<'a, 'py> PyFunctionArgument<'a, 'py> for &'a WeightedGraph

§

type Holder = Option<PyRef<'py, WeightedGraph>>

source§

fn extract( obj: &'a Bound<'py, PyAny>, holder: &'a mut Self::Holder ) -> PyResult<Self>

source§

impl<'a, 'py> PyFunctionArgument<'a, 'py> for &'a mut WeightedGraph

§

type Holder = Option<PyRefMut<'py, WeightedGraph>>

source§

fn extract( obj: &'a Bound<'py, PyAny>, holder: &'a mut Self::Holder ) -> PyResult<Self>

source§

impl PyMethods<WeightedGraph> for PyClassImplCollector<WeightedGraph>

source§

fn py_methods(self) -> &'static PyClassItems

source§

impl PyTypeInfo for WeightedGraph

source§

const NAME: &'static str = "WeightedGraph"

Class name.
source§

const MODULE: Option<&'static str> = ::core::option::Option::None

Module name, if any.
source§

fn type_object_raw(py: Python<'_>) -> *mut PyTypeObject

Returns the PyTypeObject instance for this type.
source§

fn type_object(py: Python<'_>) -> &PyType

👎Deprecated since 0.21.0: PyTypeInfo::type_object will be replaced by PyTypeInfo::type_object_bound in a future PyO3 version
Returns the safe abstraction over the type object.
source§

fn type_object_bound(py: Python<'_>) -> Bound<'_, PyType>

Returns the safe abstraction over the type object.
source§

fn is_type_of(object: &PyAny) -> bool

👎Deprecated since 0.21.0: PyTypeInfo::is_type_of will be replaced by PyTypeInfo::is_type_of_bound in a future PyO3 version
Checks if object is an instance of this type or a subclass of this type.
source§

fn is_type_of_bound(object: &Bound<'_, PyAny>) -> bool

Checks if object is an instance of this type or a subclass of this type.
source§

fn is_exact_type_of(object: &PyAny) -> bool

👎Deprecated since 0.21.0: PyTypeInfo::is_exact_type_of will be replaced by PyTypeInfo::is_exact_type_of_bound in a future PyO3 version
Checks if object is an instance of this type.
source§

fn is_exact_type_of_bound(object: &Bound<'_, PyAny>) -> bool

Checks if object is an instance of this type.
source§

impl DerefToPyAny for WeightedGraph

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> PyErrArguments for T
where T: IntoPy<Py<PyAny>> + Send + Sync,

source§

fn arguments(self, py: Python<'_>) -> Py<PyAny>

Arguments for exception
source§

impl<T> PyTypeCheck for T
where T: PyTypeInfo,

source§

const NAME: &'static str = <T as PyTypeInfo>::NAME

Name of self. This is used in error messages, for example.
source§

fn type_check(object: &Bound<'_, PyAny>) -> bool

Checks if object is an instance of Self, which may include a subtype. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

source§

fn vzip(self) -> V

source§

impl<T> Ungil for T
where T: Send,