The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
file:///E|/WEBSITE/IMPLEMEN/GRAPHBAS/IMPLEMNT.HTM ● Feedback Edge/Vertex Set (4) ● Hamiltonian Cycle (4) ● Matching (4) ● Minimum Spanning Tree (4) ● Cryptography (3) ● Shortest Path (3) ● Topological Sorting (3) ● Voronoi Diagrams (3) ● Priority Queues (2) About the Book Send us Mail Go to Main Page This page last modified on Feb 23, 1996. file:///E|/WEBSITE/IMPLEMEN/GRAPHBAS/IMPLEMNT.HTM (2 of 2) [19/1/2003 1:36:43]
1.4.1 Connected Components 1.4.1 Connected Components INPUT OUTPUT Input Description: A directed or undirected graph G . A start vertex . Problem: Traverse each edge and vertex of the connected component containing . Implementations ● LEDA - A Library of Efficient Data Types and Algorithms (C++) (rating 8) ● The Stanford GraphBase (C) (rating 4) ● GraphEd -- Graph Editor and Layout Program (C) (rating 4) ● Moret and Shapiro's Algorithms P to NP (Pascal) (rating 4) ● Combinatorica (Mathematica) (rating 3) ● Nijenhuis and Wilf: Combinatorial Algorithms (FORTRAN) (rating 2) ● Xtango and Polka Algorithm Animation Systems (C++) (rating 2) file:///E|/WEBSITE/FILES/DFS_BFS4.HTM (1 of 2) [19/1/2003 1:36:43]
- Page 1065 and 1066: Visual Links Index file:///E|/WEBSI
- Page 1067 and 1068: Visual Links Index file:///E|/WEBSI
- Page 1069 and 1070: Visual Links Index file:///E|/WEBSI
- Page 1071 and 1072: Visual Links Index file:///E|/WEBSI
- Page 1073 and 1074: Visual Links Index file:///E|/WEBSI
- Page 1075 and 1076: Visual Links Index file:///E|/WEBSI
- Page 1077 and 1078: Visual Links Index file:///E|/WEBSI
- Page 1079 and 1080: Visual Links Index file:///E|/WEBSI
- Page 1081 and 1082: Visual Links Index file:///E|/WEBSI
- Page 1083 and 1084: About the Ratings About the Ratings
- Page 1085 and 1086: 1.2 Numerical Problems 1.2 Numerica
- Page 1087 and 1088: 1.4 Graph Problems -- polynomial-ti
- Page 1089 and 1090: 1.6 Computational Geometry 1.6 Comp
- Page 1091 and 1092: C++ Language Implementations Algori
- Page 1093 and 1094: C Language Implementations ● POSI
- Page 1095 and 1096: FORTRAN Language Implementations Al
- Page 1097 and 1098: Lisp Language Implementations Algor
- Page 1099 and 1100: Algorithm Repository -- Citations C
- Page 1101 and 1102: Practical Algorithm Design -- User
- Page 1103 and 1104: LEDA - A Library of Efficient Data
- Page 1105 and 1106: Discrete Optimization Methods Discr
- Page 1107 and 1108: Netlib / TOMS -- Collected Algorith
- Page 1109 and 1110: Netlib / TOMS -- Collected Algorith
- Page 1111 and 1112: Xtango and Polka Algorithm Animatio
- Page 1113 and 1114: Combinatorica Combinatorica Combina
- Page 1115: file:///E|/WEBSITE/IMPLEMEN/GRAPHBA
- Page 1119 and 1120: 1.5.9 Graph Isomorphism 1.5.9 Graph
- Page 1121 and 1122: 1.2.3 Matrix Multiplication 1.2.3 M
- Page 1123 and 1124: 1.6.14 Motion Planning 1.6.14 Motio
- Page 1125 and 1126: 1.4.9 Network Flow 1.4.9 Network Fl
- Page 1127 and 1128: 1.1.2 Priority Queues 1.1.2 Priorit
- Page 1129 and 1130: 1.5.10 Steiner Tree 1.5.10 Steiner
- Page 1131 and 1132: 1.4.5 Transitive Closure and Reduct
- Page 1133 and 1134: About the Book -- The Algorithm Des
- Page 1135 and 1136: About the Book -- The Algorithm Des
- Page 1137 and 1138: Genocop -- Optimization via Genetic
- Page 1139 and 1140: 1.2.6 Linear Programming ● Knapsa
- Page 1141 and 1142: 1.2.7 Random Number Generation ●
- Page 1143 and 1144: 1.3.10 Satisfiability ● Constrain
- 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
1.4.1 Connected Components<br />
1.4.1 Connected Components<br />
INPUT OUTPUT<br />
Input Description: A directed or undirected graph G . A start vertex .<br />
Problem: Traverse each edge and vertex of the connected component containing .<br />
Implementations<br />
● LEDA - A Library of Efficient Data Types and <strong>Algorithm</strong>s (C++) (rating 8)<br />
● <strong>The</strong> Stanford GraphBase (C) (rating 4)<br />
● GraphEd -- Graph Editor and Layout Program (C) (rating 4)<br />
● Moret and Shapiro's <strong>Algorithm</strong>s P to NP (Pascal) (rating 4)<br />
● Combinatorica (Mathematica) (rating 3)<br />
● Nijenhuis and Wilf: Combinatorial <strong>Algorithm</strong>s (FORTRAN) (rating 2)<br />
● Xtango and Polka <strong>Algorithm</strong> Animation Systems (C++) (rating 2)<br />
file:///E|/WEBSITE/FILES/DFS_BFS4.HTM (1 of 2) [19/1/2003 1:36:43]
Change language