Стивен Скиена Алгоритмы Руководство по разработке 2е Издание 2011

/Code/

10055.c

10055.cc

10055.java

10055.pascal

8-queens.c

annealing.c

annealing.h

backtrack.c

backtrack.h

bfs-demo.c

bfs-dfs.c

biconnected.c

bignum.c

binomial.c

bipartite.c

bool.h

cgtest.c

connected.c

convex-hull.c

dfs-demo.c

dijkstra.c

distance.c

editbrute.c

editdistance.c

editdistance.h

elevator.c

fib.c

findcycle.c

floyd.c

gcd.c

geometry.c

geometry.h

geotest.c

graph.c

graph.h

item.h

kruskal.c

lcs.c

list-demo.c

list.h

Makefile

matrix.c

mwt.c

my-bi

name.c

netflow.c

order.c

partition.c

paths.c

permutations.c

plates.c

polly.c

prim.c

primes.c

priority_queue.c

priority_queue.h

queue.c

queue.h

random.c

README

sentinel.c

set_union.c

set_union.h

sorting.c

stack.c

stack.h

stringedit.c

strong.c

subsets.c

substringedit.c

sudoku.c

superman.c

test-script

topsort.c

topsort1.c

tree-demo.c

tree.h

triangulate.c

tsp.c

tsp.h

war.c

wgraph.c

wgraph.h

/Code/component-graphs/

ANSWERS

convert.m

g-1

g-2

g-3

g-4

g-5

run

strong-clr

/Code/datafiles/

10055-in

10055-out

8-queens-out

art3

baase

biconnected-art3

biconnected-baase

biconnected-clr-graph

biconnected-grid

biconnected-tree

bignum-in

bignum-in.v1

bignum-out

bipartite-art3

bipartite-grid

bipartite-tree

cgtest-in

cgtest-out

chin

chin-out

chin1

chin1-out

clr-graph

connected-in

connected-out

convex-bad.10

convex-bad.10-out

distance-out

editbrute-in

editbrute-out

elevator-in

elevator-out

g-1

g-2

g-3

g-4

g-5

gcd-in

gcd-out

geotest-in

geotest-out

grid

grid-bfs-demo-out

grid-connected-out

grid-dfs-demo-out

grid-topsort-out

grid-topsort1-out

grid4

gridw

i.10

i.10-out

i.19

i.19-out

i.2

i.2-out

i.4

i.4-out

i.9

i.9-out

lcs-out

list-in

list-out

matrix-data1

matrix-data1-out

matrix-data2

matrix-data2-out

name-in

name-out

netflow1-in

netflow1-out

netflow2-in

netflow2-out

netflow3-in

netflow3-out

order-out

outgraph.m

partition-data1

partition-data1-out

partition-data2

partition-data2-out

paths-graph

paths-graph-out

permutations-out

plates1-in

plates1-out

plates2-in

plates2-out

plates3-in

plates3-out

polly-in

polly-out

primes-in

primes-out

sorting-out

spbug-in

stringedit-in

stringedit-out

strong-clr

strong-clr-out

strong-g-1

strong-g-2

strong-g-3

strong-g-4

strong-g-5

subsets-out

substringedit-in

substringedit-out

super.m

superin1

superin1-out

superin2

superin2-out

superin2~

superin3

superin3-out

superin3~

superin4

superin4-out

t.in

t1.in

t1.out

test

tree

tree2

tree3

treelist-out

treeplus

tri1

tri1-out

tri2

tri2-out

tri3

tri3-out

VDError-uniq.dat

VDError-uniq.dat-out

VDError.dat

war-in

war-out

war-out-old

wgrid

wgrid-dijkstra-out

wgrid-disconnected1

wgrid-disconnected2

wgrid-floyd-out

wgrid-prim-out

wgrid.m

/Code/obsolete/

backtrack.v1

bfs-dfs.v1

bfs-dfs.v2

biconnected.v1

biconnected.v2

convex-hull.v1

dfs-demo.v1

diff

list-demo.v1

list-demo.v2

list-demo.v3

netflow.v1

sorting.v1

sorting.v2

sorting.v3

topsort1

tree-demo.v1

tree-demo.v2

tree-demo.v3

tree-demo.v4

tree.v1

tsp.v1

/Code/original/

10055.c

8-queens.c

annealing.c

annealing.h

backtrack.c

backtrack.h

bfs-demo.c

bfs-dfs.c

bignum.c

binomial.c

bool.h

cgtest.c

connected.c

convex-hull.c

dfs-demo.c

dijkstra.c

distance.c

editbrute.c

editdistance.c

editdistance.h

elevator.c

fib.c

findcycle.c

floyd.c

gcd.c

geometry.c

geometry.h

geotest.c

graph.c

graph.h

graphp.c

graphp.h

lcs.c

mwt.c

name.c

netflow.c

order.c

partition.c

paths.c

permutations.c

plates.c

polly.c

prim.c

primes.c

queue.c

queue.h

random.c

sentinel.c

sorting.c

stringedit.c

subsets.c

substringedit.c

sudoku.c

superman.c

topsort.c

triangulate.c

tsp.c

tsp.h

war.c

wgraph.c

wgraph.h

/Code/sudoku-examples/

champ

evil0

evil0-out

evil1

evil18

evil2

minimum1

minimum2

minimum3

puzzle

puzzle0

sudoku.v1

/Code/tsp-examples/

tsp-48

tsp-48sol

tsp48

tsp48sarun

tsp5

/

Стивен С. Скиена - Алгоритмы. Руководство по разработке (2е Издание) - 2011.djvu

Total files 339