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:
N queens problem:


* depth first search on a graph, searching for the shortest path to visit all nodes
* searching for number of ways to arrange n queens on the chessboard
* code instrumentation: current shortest path, number of paths searched
* code instrumentation: current portion of tree (vector of queen placements), number of solutions found
* profiling: netdata on host machine
* profiling: netdata on host machine
[[Category:2018]]
[[Category:February 2018]]
[[Category:Python]]
[[Category:Netdata]]
[[Category:TSP]]
[[Category:Java]]

Revision as of 07:08, 16 February 2018

Here's what we're doing:

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

N queens problem:

  • searching for number of ways to arrange n queens on the chessboard
  • code instrumentation: current portion of tree (vector of queen placements), number of solutions found
  • profiling: netdata on host machine