Tutorials# Getting Started Graph building Stability and achievable matching rates Simulations Simple and Hyper Graphs Simple graph: manual definition and basic usage Pre-defined models Path graphs Cycle graphs Star graphs Complete graphs Tadpole graphs Lollipop graphs Kayak paddle graphs Barbell graph Chained cycle graphs Erdös-Rényi graph Concatenation Package logo Hypergraphs Simple graphs as hypergraphs Nazari-Stolyar example Hyper paddle Fans Analysis of rates Tadpole Bijective tadpole Nonjective tadpole The diamond graph Not connected simple graphs Hypergraphs Candy Fans Simulation Tadpole Bijective Nonjective Diamond Trying to reach an extreme feasible solution with a greedy policy Trying to reach an extreme feasible solution with a filtering policy Reward maximization variant Fish Weighted matching Threshold-based weighting Reward-based scoring Reaching a highly degenerated vertex Pure filtering \(k\)-filtering \(\epsilon\)-filtering Extended-Gradient Primal-Dual (EGPD) Constant-Regret Primal-Dual (CRPD) Running multiple simulations Measuring the delay of a fobidden-edge policy on a injective-only vertex Comparing delay/regret trade-off for two policies
