From charlesreid1

No edit summary
No edit summary
Line 5: Line 5:
* where in structure, depth, iterations, etc.
* where in structure, depth, iterations, etc.


Traveling salesman problem
Traveling salesman problem:
 
* depth first search on a graph, searching for the shortest path to visit all nodes
* code instrumentation: current shortest path, number of paths searched
* profiling: netdata on host machine

Revision as of 05:21, 16 February 2018

Here's what we're doing:

  • Running CPU intensive code
  • cpu, memory, threads, file size
  • where in structure, depth, iterations, etc.

Traveling salesman problem:

  • depth first search on a graph, searching for the shortest path to visit all nodes
  • code instrumentation: current shortest path, number of paths searched
  • profiling: netdata on host machine