Implementation of graphs.
parti * tarjan(graph *g)
Tarjan's algorihtm for unlabeled graphs.
Definition graphs_tarjan.c:8
dgraph * dgraph_extract(dgraph *g, parti *P, uint *inv, uint j)
Extracts a single SCC of a dgraph and makes it a new dgraph.
Definition graphs_tarjan.c:629
parti * dtarjan(dgraph *g, bool *alph, bool ismor)
Tarjan's algorihtm for complete deterministic labeled graphs.
Definition graphs_tarjan.c:293
void dgraph_discard_nonscc_edges(dgraph *g, parti *sccs)
Modifies a dgraph by discarding all edges that are not internal to an SCC.
Definition graphs_tarjan.c:743
void dgraph_compute_alph_scc(dgraph *g, parti *sccs, uint scc, bool *alph)
Computes the alphabet of a strongly connected component of a labeled graph.
Definition graphs_tarjan.c:650
parti * ltarjan(lgraph *g, bool *alph)
Tarjan's algorihtm for labeled graphs.
Definition graphs_tarjan.c:135
dgraph * dgraph_copy_discard_nonscc_edges(dgraph *g, parti *sccs)
Copies a dgraph while discarding all edges that go from a state to a different SCC.
Definition graphs_tarjan.c:758
bool dgraph_common_alph_loop(dgraph *g, parti *sccs, uint *inv_sccs, uint q1, uint q2, bool *alph)
Computes the alphabet of a strongly connected component of a labeled graph.
Definition graphs_tarjan.c:714
bool dgraph_ntrivial_loop(dgraph *g, parti *sccs, uint q)
Tests if there exists a non-trivial loop on a given state q of a dgraph.
Definition graphs_tarjan.c:778
parti * dualdtarjan(dgraph *g1, dgraph *g2, bool *alph, bool ismor)
Tarjan's algorihtm for two complete deterministic labeled graphs sharing the same state set and alpha...
Definition graphs_tarjan.c:456
Type used to represent a complete deterministic directed labeled graph.
Definition graphs.h:73
Type used to represent a directed unlabeled graph.
Definition graphs.h:42
Type used to represent a directed labeled graph.
Definition graphs.h:57
First type used to represent a partition. This is not the one used by Union-Find.
Definition type_partitions.h:36
Types used to represent partitions. Includes the union-find algorithm.