The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
1.1.4 Graph Data Structures 1.1.4 Graph Data Structures INPUT OUTPUT Input Description: A graph G . Problem: Give an efficient, flexible data structure to represent G . Implementations ● LEDA - A Library of Efficient Data Types and Algorithms (C++) (rating 10) ● GraphEd -- Graph Editor and Layout Program (C) (rating 8) ● Combinatorica (Mathematica) (rating 6) ● The Stanford GraphBase (C) (rating 6) ● LINK -- Programming and Visualization Environment for Hypergraphs (C++) (rating 6) ● Moret and Shapiro's Algorithms P to NP (Pascal) (rating 4) Related Problems file:///E|/WEBSITE/FILES/GRAPURES.HTM (1 of 2) [19/1/2003 1:37:14]
1.1.4 Graph Data Structures ● Graph Partition ● Set Data Structures Go to the corresponding chapter in the book About the Book Send us Mail Go to Main Page This page last modified on Tue Jun 03, 1997 . file:///E|/WEBSITE/FILES/GRAPURES.HTM (2 of 2) [19/1/2003 1:37:14]
- Page 1145 and 1146: Qhull - higher dimensional convex h
- Page 1147 and 1148: 1.6.5 Nearest Neighbor Search 1.6.5
- Page 1149 and 1150: 1.6.7 Point Location 1.6.7 Point Lo
- Page 1151 and 1152: 1.6.10 Medial-Axis Transformation 1
- Page 1153 and 1154: 1.6.3 Triangulation 1.6.3 Triangula
- Page 1155 and 1156: Nijenhuis and Wilf: Combinatorial A
- Page 1157 and 1158: 1.5.5 Hamiltonian Cycle 1.5.5 Hamil
- Page 1159 and 1160: 1.4.6 Matching 1.4.6 Matching INPUT
- Page 1161 and 1162: A compendium of NP optimization pro
- Page 1163 and 1164: 1.6.9 Bin Packing 1.6.9 Bin Packing
- Page 1165 and 1166: 1.6.12 Simplifying Polygons 1.6.12
- Page 1167 and 1168: 1.6.13 Shape Similarity 1.6.13 Shap
- Page 1169 and 1170: 1.6.11 Polygon Partitioning 1.6.11
- Page 1171 and 1172: 1.4.3 Minimum Spanning Tree 1.4.3 M
- Page 1173 and 1174: 1.6.15 Maintaining Line Arrangement
- Page 1175 and 1176: 1.3.7 Generating Graphs 1.3.7 Gener
- Page 1177 and 1178: 1.2.11 Discrete Fourier Transform 1
- Page 1179 and 1180: 1.5.8 Edge Coloring 1.5.8 Edge Colo
- Page 1181 and 1182: 1.3.3 Median and Selection 1.3.3 Me
- Page 1183 and 1184: 1.3.1 Sorting 1.3.1 Sorting INPUT O
- Page 1185 and 1186: Plugins for use with the CDROM Plug
- Page 1187 and 1188: Implementation Challenges Next: Dat
- Page 1189 and 1190: Implementation Challenges Next: Gra
- Page 1191 and 1192: Implementation Challenges Next: Int
- Page 1193 and 1194: Caveats Next: Data Structures Up: A
- Page 1195: 1.1.1 Dictionaries ● Priority Que
- Page 1199 and 1200: 1.1.5 Set Data Structures ● Gener
- Page 1201 and 1202: 1.2.1 Solving Linear Equations ●
- Page 1203 and 1204: 1.2.2 Bandwidth Reduction ● Topol
- Page 1205 and 1206: 1.2.4 Determinants and Permanents
- Page 1207 and 1208: 1.2.8 Factoring and Primality Testi
- Page 1209 and 1210: 1.2.9 Arbitrary Precision Arithmeti
- Page 1211 and 1212: 1.2.10 Knapsack Problem ● Linear
- Page 1213 and 1214: 1.3.2 Searching ● Sorting Go to t
- Page 1215 and 1216: 1.3.4 Generating Permutations ● C
- Page 1217 and 1218: 1.3.5 Generating Subsets ● Genera
- Page 1219 and 1220: 1.3.6 Generating Partitions ● Gen
- Page 1221 and 1222: 1.3.8 Calendrical Calculations Go t
- Page 1223 and 1224: 1.3.9 Job Scheduling ● Feedback E
- Page 1225 and 1226: 1.4.2 Topological Sorting Related P
- Page 1227 and 1228: 1.4.8 Edge and Vertex Connectivity
- Page 1229 and 1230: 1.4.10 Drawing Graphs Nicely ● Pl
- Page 1231 and 1232: 1.4.11 Drawing Trees ● Planarity
- Page 1233 and 1234: 1.4.12 Planarity Detection and Embe
- Page 1235 and 1236: 1.5.2 Independent Set ● Vertex Co
- Page 1237 and 1238: 1.5.3 Vertex Cover ● Independent
- Page 1239 and 1240: 1.5.4 Traveling Salesman Problem
- Page 1241 and 1242: 1.5.6 Graph Partition ● Network F
- Page 1243 and 1244: 1.5.7 Vertex Coloring Related Probl
- Page 1245 and 1246: 1.5.11 Feedback Edge/Vertex Set Go
1.1.4 Graph Data Structures<br />
1.1.4 Graph Data Structures<br />
INPUT OUTPUT<br />
Input Description: A graph G .<br />
Problem: Give an efficient, flexible data structure to represent G .<br />
Implementations<br />
● LEDA - A Library of Efficient Data Types and <strong>Algorithm</strong>s (C++) (rating 10)<br />
● GraphEd -- Graph Editor and Layout Program (C) (rating 8)<br />
● Combinatorica (Mathematica) (rating 6)<br />
● <strong>The</strong> Stanford GraphBase (C) (rating 6)<br />
● LINK -- Programming and Visualization Environment for Hypergraphs (C++) (rating 6)<br />
● Moret and Shapiro's <strong>Algorithm</strong>s P to NP (Pascal) (rating 4)<br />
Related Problems<br />
file:///E|/WEBSITE/FILES/GRAPURES.HTM (1 of 2) [19/1/2003 1:37:14]