• Choose a category
• All
• Classic-Fiction

in-degree, Description of Graphs

incidence, Description of Graphs

initialize, Return Value, graph_init

insert edge, Return Value, graph_ins_edge

insert vertex, Return Value, graph_ins_vertex

interface for, graph_init

internet, Questions and Answers

multigraphs, Related Topics

out-degree, Description of Graphs

paths, Description of Graphs

precedence, Graph Example: Topological Sorting

remove edge, Return Value, graph_rem_edge

remove vertex, Return Value, graph_rem_vertex

retrieve adjacency list, Return Value, graph_adjlist

search methods, Graphs, Search Methods

sparse, Description of Graphs

strongly connected, Description of Graphs

topological sorting, Graph Example: Topological Sorting

transpose of, Questions and Answers

undirected, Description of Graphs

vertices, Graphs, Description of Graphs

weighted, Graph Algorithms

graph_adjlist, Return Value, graph_adjlist, graph_adjlists, graph_vcount, graph_ecount

graph_adjlists, Return Value

graph_destroy, Return Value, graph_destroy, graph_adjlists, graph_vcount, graph_ecount

graph_ecount, Return Value

graph_init, Return Value, graph_init, graph_adjlists, graph_vcount, graph_ecount

graph_ins_edge, Return Value, graph_ins_edge, graph_adjlists, graph_vcount, graph_ecount

graph_ins_vertex, Return Value, graph_ins_vertex, graph_adjlists, graph_vcount, graph_ecount

graph_is_adjacent, Return Value, graph_is_adjacent, graph_adjlists, graph_vcount, graph_ecount

graph_rem_edge, Return Value, graph_rem_edge, graph_adjlists, graph_vcount, graph_ecount

graph_rem_vertex, Return Value, graph_rem_vertex, graph_adjlists, graph_vcount, graph_ecount

graph_vcount, Return Value

great-circle distances, Arc Length Example: Approximating Distances on Earth

greedy algorithm, Greedy algorithms

growth rate, O-Notation

H

hamiltonian cycles, Graphs, Description of the Traveling-Salesman Problem, Questions and Answers

harmonic series, Questions and Answers

hash coding, Hash Tables

hash functions, Hash Tables

hash tables, Hash Tables, Hash Tables, Hash Tables, Hash Tables, Hash Tables, Hash Tables, Hash Tables, Hash Tables, Hash Tables, Hash Tables, Description of Chained Hash Tables, Collision Resolution, Collision Resolution, Multiplication method, Description of Open-Addressed Hash Tables, Related Topics, Related Topics, Related Topics, Related Topics

applications of, Hash Tables

chained, Description of Chained Hash Tables

colliding keys, Hash Tables

collision resolution, Hash Tables

direct-address tables, Related Topics

directly addressed, Hash Tables

key, Hash Tables

load factor, Collision Resolution

multiplication method, Multiplication method

open-addressed, Hash Tables, Description of Open-Addressed Hash Tables

quadratic probing, Related Topics

random number generators, Related Topics

selecting a hash function, Hash Tables

symbol tables, Hash Tables

uniform hashing, Collision Resolution

universal hashing, Related Topics

hash values, Hash Tables

hashing, Hash Tables, Division method, Multiplication method

by division method, Division method

by multiplication method, Multiplication method

hashpjw function, Multiplication method

Heap structure, Implementation and Analysis of Heaps

heap-based allocation, Related Topics

heaps, Heaps and Priority Queues, Heaps and Priority Queues, Description of Heaps, Description of Heaps, Description of Heaps, Description of Heaps, Description of Heaps, Description of Heaps, Interface for Heaps, Return Value, Return Value, Return Value, Return Value, Return Value, heap_init, heap_destroy, heap_insert, heap_insert, heap_extract, heap_size, Questions and Answers, Related Topics, Related Topics

applications of, Heaps and Priority Queues

balancing, Description of Heaps

bottom-heavy, Description of Heaps

description of, Description of Heaps

destroy, Return Value, heap_destroy

extract node, Return Value

Fibonacci, Related Topics

heapification, Questions and Answers

initialize, Return Value, heap_init

insert