Module contest_algorithms::graph

Basic graph module without explicit support for deletion.

Panics

All methods will panic if given an out-of-bounds element index.

Modules

connectivity	Graph connectivity structures.
flow	Maximum flows, matchings, and minimum cuts.

Structs

AdjListIterator	An iterator for convenient adjacency list traversal.
DisjointSets	Represents a union of disjoint sets. Each set's elements are arranged in a tree, whose root is the set's representative.
Graph	A compact graph representation. Edges are numbered in order of insertion. Each adjacency list consists of all edges pointing out from a given vertex.