ACYCLIC\_SHORTEST\_PATH & shortest\_path.h & libG & \htmlref{Shortest Path Algorithms}{Shortest Path Algorithms} \\
ACYCLIC\_SHORTEST\_PATH\_T & \multicolumn{2}{l}{ templates/shortest\_path.t } & \htmlref{Shortest Path Algorithms}{Shortest Path Algorithms} \\
ALL\_EMPTY\_CIRCLES & plane\_alg.h & libP & \htmlref{Plane Algorithms}{Plane Algorithms} \\
ALL\_ENCLOSING\_CIRCLES & plane\_alg.h & libP & \htmlref{Plane Algorithms}{Plane Algorithms} \\
ALL\_PAIRS\_SHORTEST\_PATHS & shortest\_path.h & libG & \htmlref{Shortest Path Algorithms}{Shortest Path Algorithms} \\
ALL\_PAIRS\_SHORTEST\_PATHS\_T & \multicolumn{2}{l}{ templates/shortest\_path.t } & \htmlref{Shortest Path Algorithms}{Shortest Path Algorithms} \\
BELLMAN\_FORD & shortest\_path.h & libG & \htmlref{Shortest Path Algorithms}{Shortest Path Algorithms} \\
BELLMAN\_FORD\_B & shortest\_path.h & libG & \htmlref{Shortest Path Algorithms}{Shortest Path Algorithms} \\
BELLMAN\_FORD\_B\_T & \multicolumn{2}{l}{ templates/shortest\_path.t } & \htmlref{Shortest Path Algorithms}{Shortest Path Algorithms} \\
BELLMAN\_FORD\_T & \multicolumn{2}{l}{ templates/shortest\_path.t } & \htmlref{Shortest Path Algorithms}{Shortest Path Algorithms} \\
BFS & basic\_graph\_alg.h & libG & \htmlref{Basic Graph Algorithms}{Basic Graph Algorithms} \\
BF\_GEN & shortest\_path.h & libG & \htmlref{Shortest Path Algorithms}{Shortest Path Algorithms} \\
BICONNECTED\_COMPONENTS & basic\_graph\_alg.h & libG & \htmlref{Basic Graph Algorithms}{Basic Graph Algorithms} \\
CHECK\_KURATOWSKI & plane\_graph\_alg.h & libG & \htmlref{Algorithms for Planar Graphs}{Algorithms for Planar Graphs} \\
CHECK\_MAX\_CARD\_MATCHING & mc\_matching.h & libG & \htmlref{Maximum Cardinality Matchings in General Graphs}{Maximum Cardinality Matchings in General Graphs} \\
CHECK\_MAX\_FLOW & max\_flow.h & libG & \htmlref{Maximum Flow}{Maximum Flow} \\
CHECK\_MAX\_FLOW\_T & \multicolumn{2}{l}{ templates/max\_flow.t } & \htmlref{Maximum Flow}{Maximum Flow} \\
CHECK\_MAX\_WEIGHT\_ASSIGNMENT & mwb\_matching.h & libG & \htmlref{Bipartite Weighted Matchings and Assignments}{Bipartite Weighted Matchings and Assignments} \\
CHECK\_MAX\_WEIGHT\_ASSIGNMENT\_T & \multicolumn{2}{l}{ templates/mwb\_matching.t } & \htmlref{Bipartite Weighted Matchings and Assignments}{Bipartite Weighted Matchings and Assignments} \\
CHECK\_MCB & mcb\_matching.h & libG & \htmlref{Maximum Cardinality Matchings in Bipartite Graphs}{Maximum Cardinality Matchings in Bipartite Graphs} \\
CHECK\_MIN\_WEIGHT\_ASSIGNMENT & mwb\_matching.h & libG & \htmlref{Bipartite Weighted Matchings and Assignments}{Bipartite Weighted Matchings and Assignments} \\
CHECK\_MIN\_WEIGHT\_ASSIGNMENT\_T & \multicolumn{2}{l}{ templates/mwb\_matching.t } & \htmlref{Bipartite Weighted Matchings and Assignments}{Bipartite Weighted Matchings and Assignments} \\
CHECK\_MWBM & mwb\_matching.h & libG & \htmlref{Bipartite Weighted Matchings and Assignments}{Bipartite Weighted Matchings and Assignments} \\
CHECK\_MWBM\_T & \multicolumn{2}{l}{ templates/mwb\_matching.t } & \htmlref{Bipartite Weighted Matchings and Assignments}{Bipartite Weighted Matchings and Assignments} \\
CHECK\_SP & shortest\_path.h & libG & \htmlref{Shortest Path Algorithms}{Shortest Path Algorithms} \\
CHECK\_SP\_T & \multicolumn{2}{l}{ templates/shortest\_path.t } & \htmlref{Shortest Path Algorithms}{Shortest Path Algorithms} \\
CLOSEST\_PAIR & plane\_alg.h & libP & \htmlref{Plane Algorithms}{Plane Algorithms} \\
COMPONENTS & basic\_graph\_alg.h & libG & \htmlref{Basic Graph Algorithms}{Basic Graph Algorithms} \\
CONVEX\_HULL & plane\_alg.h & libP & \htmlref{Plane Algorithms}{Plane Algorithms} \\
CopyGraph & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
DELAUNAY\_DIAGRAM & plane\_alg.h & libP & \htmlref{Plane Algorithms}{Plane Algorithms} \\
DELAUNAY\_TRIANG & plane\_alg.h & libP & \htmlref{Plane Algorithms}{Plane Algorithms} \\
DFS & basic\_graph\_alg.h & libG & \htmlref{Basic Graph Algorithms}{Basic Graph Algorithms} \\
DFS\_NUM & basic\_graph\_alg.h & libG & \htmlref{Basic Graph Algorithms}{Basic Graph Algorithms} \\
DIJKSTRA & shortest\_path.h & libG & \htmlref{Shortest Path Algorithms}{Shortest Path Algorithms} \\
DIJKSTRA\_T & \multicolumn{2}{l}{ templates/shortest\_path.t } & \htmlref{Shortest Path Algorithms}{Shortest Path Algorithms} \\
Delete\_Loops & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
FIVE\_COLOR & plane\_graph\_alg.h & libG & \htmlref{Algorithms for Planar Graphs}{Algorithms for Planar Graphs} \\
F\_DELAUNAY\_DIAGRAM & plane\_alg.h & libP & \htmlref{Plane Algorithms}{Plane Algorithms} \\
F\_DELAUNAY\_TRIANG & plane\_alg.h & libP & \htmlref{Plane Algorithms}{Plane Algorithms} \\
F\_VORONOI & plane\_alg.h & libP & \htmlref{Plane Algorithms}{Plane Algorithms} \\
Genus & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
INDEPENDENT\_SET & plane\_graph\_alg.h & libG & \htmlref{Algorithms for Planar Graphs}{Algorithms for Planar Graphs} \\
Is\_Acyclic & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
Is\_Biconnected & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
Is\_Bidirected & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
Is\_Bipartite & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
Is\_CCW\_Ordered & plane\_graph\_alg.h & libG & \htmlref{Algorithms for Planar Graphs}{Algorithms for Planar Graphs} \\
Is\_Connected & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
Is\_Loopfree & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
Is\_Map & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
Is\_Planar & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
Is\_Planar\_Map & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
Is\_Plane\_Map & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
Is\_Simple & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
Is\_Simple\_Loopfree & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
Is\_Simple\_Polygon & plane\_alg.h & libP & \htmlref{Plane Algorithms}{Plane Algorithms} \\
Is\_Simple\_Undirected & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
Is\_Triconnected & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
KURATOWSKI & plane\_graph\_alg.h & libG & \htmlref{Algorithms for Planar Graphs}{Algorithms for Planar Graphs} \\
LARGEST\_EMPTY\_CIRCLE & plane\_alg.h & libP & \htmlref{Plane Algorithms}{Plane Algorithms} \\
MAX\_CARD\_BIPARTITE\_MATCHING & mcb\_matching.h & libG & \htmlref{Maximum Cardinality Matchings in Bipartite Graphs}{Maximum Cardinality Matchings in Bipartite Graphs} \\
MAX\_CARD\_MATCHING & mc\_matching.h & libG & \htmlref{Maximum Cardinality Matchings in General Graphs}{Maximum Cardinality Matchings in General Graphs} \\
MAX\_FLOW & max\_flow.h & libG & \htmlref{Maximum Flow}{Maximum Flow} \\
MAX\_FLOW\_BASIC & max\_flow.h & libG & \htmlref{Maximum Flow}{Maximum Flow} \\
MAX\_FLOW\_BASIC\_T & \multicolumn{2}{l}{ templates/max\_flow.t } & \htmlref{Maximum Flow}{Maximum Flow} \\
MAX\_FLOW\_GAP & max\_flow.h & libG & \htmlref{Maximum Flow}{Maximum Flow} \\
MAX\_FLOW\_GAP\_T & \multicolumn{2}{l}{ templates/max\_flow.t } & \htmlref{Maximum Flow}{Maximum Flow} \\
MAX\_FLOW\_GRH & max\_flow.h & libG & \htmlref{Maximum Flow}{Maximum Flow} \\
MAX\_FLOW\_GRH\_T & \multicolumn{2}{l}{ templates/max\_flow.t } & \htmlref{Maximum Flow}{Maximum Flow} \\
MAX\_FLOW\_LH & max\_flow.h & libG & \htmlref{Maximum Flow}{Maximum Flow} \\
MAX\_FLOW\_LH\_T & \multicolumn{2}{l}{ templates/max\_flow.t } & \htmlref{Maximum Flow}{Maximum Flow} \\
MAX\_FLOW\_LRH & max\_flow.h & libG & \htmlref{Maximum Flow}{Maximum Flow} \\
MAX\_FLOW\_LRH\_T & \multicolumn{2}{l}{ templates/max\_flow.t } & \htmlref{Maximum Flow}{Maximum Flow} \\
MAX\_FLOW\_T & \multicolumn{2}{l}{ templates/max\_flow.t } & \htmlref{Maximum Flow}{Maximum Flow} \\
MAX\_WEIGHT\_ASSIGNMENT & mwb\_matching.h & libG & \htmlref{Bipartite Weighted Matchings and Assignments}{Bipartite Weighted Matchings and Assignments} \\
MAX\_WEIGHT\_ASSIGNMENT\_T & \multicolumn{2}{l}{ templates/mwb\_matching.t } & \htmlref{Bipartite Weighted Matchings and Assignments}{Bipartite Weighted Matchings and Assignments} \\
MAX\_WEIGHT\_BIPARTITE\_MATCHING & mwb\_matching.h & libG & \htmlref{Bipartite Weighted Matchings and Assignments}{Bipartite Weighted Matchings and Assignments} \\
MAX\_WEIGHT\_BIPARTITE\_MATCHING\_T & \multicolumn{2}{l}{ templates/mwb\_matching.t } & \htmlref{Bipartite Weighted Matchings and Assignments}{Bipartite Weighted Matchings and Assignments} \\
MINIMUM\_RATIO\_CYCLE & shortest\_path.h & libG & \htmlref{Shortest Path Algorithms}{Shortest Path Algorithms} \\
MIN\_AREA\_ANNULUS & plane\_alg.h & libP & \htmlref{Plane Algorithms}{Plane Algorithms} \\
MIN\_COST\_FLOW & min\_cost\_flow.h & libG & \htmlref{Min Cost Flow Algorithms}{Min Cost Flow Algorithms} \\
MIN\_COST\_MAX\_FLOW & min\_cost\_flow.h & libG & \htmlref{Min Cost Flow Algorithms}{Min Cost Flow Algorithms} \\
MIN\_CUT & min\_cut.h & libG & \htmlref{Minimum Cut}{Minimum Cut} \\
MIN\_SPANNING\_TREE & plane\_alg.h & libP & \htmlref{Plane Algorithms}{Plane Algorithms} \\
MIN\_WEIGHT\_ASSIGNMENT & mwb\_matching.h & libG & \htmlref{Bipartite Weighted Matchings and Assignments}{Bipartite Weighted Matchings and Assignments} \\
MIN\_WEIGHT\_ASSIGNMENT\_T & \multicolumn{2}{l}{ templates/mwb\_matching.t } & \htmlref{Bipartite Weighted Matchings and Assignments}{Bipartite Weighted Matchings and Assignments} \\
MIN\_WIDTH\_ANNULUS & plane\_alg.h & libP & \htmlref{Plane Algorithms}{Plane Algorithms} \\
MULMULEY\_SEGMENTS & plane\_alg.h & libP & \htmlref{Plane Algorithms}{Plane Algorithms} \\
MWMCB\_MATCHING & mwb\_matching.h & libG & \htmlref{Bipartite Weighted Matchings and Assignments}{Bipartite Weighted Matchings and Assignments} \\
MWMCB\_MATCHING\_T & \multicolumn{2}{l}{ templates/mwb\_matching.t } & \htmlref{Bipartite Weighted Matchings and Assignments}{Bipartite Weighted Matchings and Assignments} \\
Make\_Acyclic & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
Make\_Biconnected & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
Make\_Bidirected & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
Make\_Connected & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
Make\_Simple & graph\_misc.h & libG & \htmlref{Miscellaneous Graph Functions}{Miscellaneous Graph Functions} \\
ORTHO\_EMBEDDING & graph\_draw.h & libG & \htmlref{Graph Drawing Algorithms}{Graph Drawing Algorithms} \\
PLANAR & plane\_graph\_alg.h & libG & \htmlref{Algorithms for Planar Graphs}{Algorithms for Planar Graphs} \\
SEGMENT\_INTERSECTION & plane\_alg.h & libP & \htmlref{Plane Algorithms}{Plane Algorithms} \\
SHORTEST\_PATH & shortest\_path.h & libG & \htmlref{Shortest Path Algorithms}{Shortest Path Algorithms} \\
SHORTEST\_PATH\_T & \multicolumn{2}{l}{ templates/shortest\_path.t } & \htmlref{Shortest Path Algorithms}{Shortest Path Algorithms} \\
SMALLEST\_ENCLOSING\_CIRCLE & plane\_alg.h & libP & \htmlref{Plane Algorithms}{Plane Algorithms} \\
SORT\_EDGES & plane\_graph\_alg.h & libG & \htmlref{Algorithms for Planar Graphs}{Algorithms for Planar Graphs} \\
SPANNING\_TREE & min\_span.h & libG & \htmlref{Minimum Spanning Trees}{Minimum Spanning Trees} \\
SPRING\_EMBEDDING & graph\_draw.h & libG & \htmlref{Graph Drawing Algorithms}{Graph Drawing Algorithms} \\
STRAIGHT\_LINE\_EMBEDDING & graph\_draw.h & libG & \htmlref{Graph Drawing Algorithms}{Graph Drawing Algorithms} \\
STRONG\_COMPONENTS & basic\_graph\_alg.h & libG & \htmlref{Basic Graph Algorithms}{Basic Graph Algorithms} \\
ST\_NUMBERING & plane\_graph\_alg.h & libG & \htmlref{Algorithms for Planar Graphs}{Algorithms for Planar Graphs} \\
SWEEP\_SEGMENTS & plane\_alg.h & libP & \htmlref{Plane Algorithms}{Plane Algorithms} \\
TOPSORT & basic\_graph\_alg.h & libG & \htmlref{Basic Graph Algorithms}{Basic Graph Algorithms} \\
TRANSITIVE\_CLOSURE & basic\_graph\_alg.h & libG & \htmlref{Basic Graph Algorithms}{Basic Graph Algorithms} \\
TRIANGULATE\_PLANAR\_MAP & plane\_graph\_alg.h & libG & \htmlref{Algorithms for Planar Graphs}{Algorithms for Planar Graphs} \\
TRIANGULATE\_POINTS & plane\_alg.h & libP & \htmlref{Plane Algorithms}{Plane Algorithms} \\
TUTTE\_EMBEDDING & graph\_draw.h & libG & \htmlref{Graph Drawing Algorithms}{Graph Drawing Algorithms} \\
VORONOI & plane\_alg.h & libP & \htmlref{Plane Algorithms}{Plane Algorithms} \\
cmdline\_graph & graph\_gen.h & libG & \htmlref{Graph Generators}{Graph Generators} \\
complete\_bigraph & graph\_gen.h & libG & \htmlref{Graph Generators}{Graph Generators} \\
complete\_graph & graph\_gen.h & libG & \htmlref{Graph Generators}{Graph Generators} \\
complete\_ugraph & graph\_gen.h & libG & \htmlref{Graph Generators}{Graph Generators} \\
get\_directories & file.h & libL & \htmlref{Files and Directories}{Files and Directories} \\
get\_directory & file.h & libL & \htmlref{Files and Directories}{Files and Directories} \\
get\_entries & file.h & libL & \htmlref{Files and Directories}{Files and Directories} \\
get\_files & file.h & libL & \htmlref{Files and Directories}{Files and Directories} \\
grid\_graph & graph\_gen.h & libG & \htmlref{Graph Generators}{Graph Generators} \\
is\_directory & file.h & libL & \htmlref{Files and Directories}{Files and Directories} \\
is\_file & file.h & libL & \htmlref{Files and Directories}{Files and Directories} \\
is\_link & file.h & libL & \htmlref{Files and Directories}{Files and Directories} \\
max\_flow\_gen\_AMO & max\_flow.h & libG & \htmlref{Maximum Flow}{Maximum Flow} \\
max\_flow\_gen\_CG1 & max\_flow.h & libG & \htmlref{Maximum Flow}{Maximum Flow} \\
max\_flow\_gen\_CG2 & max\_flow.h & libG & \htmlref{Maximum Flow}{Maximum Flow} \\
max\_flow\_gen\_rand & max\_flow.h & libG & \htmlref{Maximum Flow}{Maximum Flow} \\
maximal\_planar\_graph & graph\_gen.h & libG & \htmlref{Graph Generators}{Graph Generators} \\
maximal\_planar\_map & graph\_gen.h & libG & \htmlref{Graph Generators}{Graph Generators} \\
random\_bigraph & graph\_gen.h & libG & \htmlref{Graph Generators}{Graph Generators} \\
random\_graph & graph\_gen.h & libG & \htmlref{Graph Generators}{Graph Generators} \\
random\_graph\_noncompact & graph\_gen.h & libG & \htmlref{Graph Generators}{Graph Generators} \\
random\_planar\_graph & graph\_gen.h & libG & \htmlref{Graph Generators}{Graph Generators} \\
random\_planar\_map & graph\_gen.h & libG & \htmlref{Graph Generators}{Graph Generators} \\
random\_simple\_graph & graph\_gen.h & libG & \htmlref{Graph Generators}{Graph Generators} \\
random\_simple\_loopfree\_graph & graph\_gen.h & libG & \htmlref{Graph Generators}{Graph Generators} \\
random\_simple\_undirected\_graph & graph\_gen.h & libG & \htmlref{Graph Generators}{Graph Generators} \\
set\_directory & file.h & libL & \htmlref{Files and Directories}{Files and Directories} \\
test\_bigraph & graph\_gen.h & libG & \htmlref{Graph Generators}{Graph Generators} \\
test\_graph & graph\_gen.h & libG & \htmlref{Graph Generators}{Graph Generators} \\
triangulated\_planar\_graph & graph\_gen.h & libG & \htmlref{Graph Generators}{Graph Generators} \\
triangulation\_graph & graph\_gen.h & libG & \htmlref{Graph Generators}{Graph Generators} \\
triangulation\_map & graph\_gen.h & libG & \htmlref{Graph Generators}{Graph Generators} \\
