Concepts and algorithms

In this wiki page I will try to explain with my own words (or shamelessly ripping out definitions from people that actually know how to explain) some concepts used in the wiki.

• Control Flow Graph. From [wikipedia](Control Flow Graph): A control flow graph (CFG) in computer science is a representation, using graph notation, of all paths that might be traversed through a program during its execution. The control flow graph is due to Frances E. Allen, who notes that Reese T. Prosser used boolean connectivity matrices for flow analysis before.
• Call Graph. From wikipedia: A call graph (also known as a call multigraph) is a control flow graph, which represents calling relationships between subroutines in a computer program. Each node represents a procedure and each edge (f, g) indicates that procedure f calls procedure g. Thus, a cycle in the graph indicates recursive procedure calls.
• Fuzzy hash. A hash that uses fuzzy logic to match groups of elements. In opposite to, for example, a cryptographic hash that tries to match unequivocally a single element.