Index

A

all_elements() (posets.poset.Poset method)

all_intervals() (posets.poset.Poset method)

B

BipartiteMatching (class in graph.matching)

BipartitePreferences (class in graph.matching) boolean_lattice() (posets.example_posets.ExamplePosets method)

C

Chromatic (class in graph.polynomial) contract_edge() (in module graph.manipulation)

count_cut_edges() (in module graph.enumeration) count_loops() (in module graph.enumeration) count_spanning_trees() (in module graph.enumeration)

E

evaluate() (graph.polynomial.Chromatic method) (graph.polynomial.Tutte method)

ExamplePosets (class in posets.example_posets)

F

finite_chain() (posets.example_posets.ExamplePosets method)

G

general.utils module generate_polynomial() (graph.polynomial.Chromatic method) (graph.polynomial.Tutte method) get_cut_edges() (in module graph.enumeration) get_loops() (in module graph.enumeration) get_oeis_entry() (in module general.utils)

get_one() (posets.poset.Poset method) get_zero() (posets.poset.Poset method) graph.distance module graph.enumeration module graph.manipulation module

I

interval() (posets.poset.Poset method) interval_len() (posets.poset.Poset method) is_Eulerian() (posets.poset.Poset method)

is_greaterthan() (posets.poset.Poset method) is_lessthan() (posets.poset.Poset method) is_semi_Eulerian() (posets.poset.Poset method) is_stable_matching() (graph.matching.BipartiteMatching method)

M

max_weight_matching() (graph.matching.BipartiteMatching method) mobius() (posets.poset.Poset method) module general.utils graph.distance graph.enumeration graph.manipulation posets.example_posets posets.poset posets.utils

multiply_edges() (in module graph.manipulation)

N

numerical_order() (graph.matching.BipartitePreferences method)

P

parse_coverage_list() (in module posets.utils) pathify_edges() (in module graph.manipulation) Poset (class in posets.poset) posets.example_posets module

posets.poset module posets.utils module

S

score_preference_rank() (graph.matching.BipartiteMatching method)

shortest_path() (in module graph.distance) single_source_shortest_paths() (in module graph.distance)

T

Tutte (class in graph.polynomial)