GRAPH-TOUR
Arguments: graph solu link order trav stat [generic-function]
Builds a (quasi-) optimal path between chords that have been organized into
a graph with the box 'make-graph'. If the relation used in make-graph is the amount
of common notes, graph-tour delivers a sequence of chords where the amount of common
notes between successive chords has been maximized (or minimized). There are as many different
solutions as there are nodes (i.e. chords) in the graph.
a graph with the box 'make-graph'. If the relation used in make-graph is the amount
of common notes, graph-tour delivers a sequence of chords where the amount of common
notes between successive chords has been maximized (or minimized). There are as many different
solutions as there are nodes (i.e. chords) in the graph.
parameters
graph : the output of a 'make-graph' box
solu : positive integer. Choose a solution between 0 and n-1 (n is the number of chords)
link : (optional, menu) if 'with link' adds a low common note when there is no common notes between 2 chords.
order : (optional, menu) if 'maximize' look for path that maximizes the relations (default). If 'minimize' look for path of maximum contrast.
trav : (optional, menu) if 'short' (default) short path without repetitions. If 'long' long path with repetitions.
stat : (optional, menu) if 'one solution' (default) output the solu(nth) solution. If 'statistics' print all the solutions with an
optimality factor.
solu : positive integer. Choose a solution between 0 and n-1 (n is the number of chords)
link : (optional, menu) if 'with link' adds a low common note when there is no common notes between 2 chords.
order : (optional, menu) if 'maximize' look for path that maximizes the relations (default). If 'minimize' look for path of maximum contrast.
trav : (optional, menu) if 'short' (default) short path without repetitions. If 'long' long path with repetitions.
stat : (optional, menu) if 'one solution' (default) output the solu(nth) solution. If 'statistics' print all the solutions with an
optimality factor.
output
Depends on the kind objects that have been put into the graph (see 'make-graph') :
If the graph was built with a list of lists of integers, output is a list of lists of integers.
If the graph was built with a list of chord-objects or a chord-line object, output is list of chord objects.
The output is generally connected to the 'chords' input of a 'chordseq' box.
If the graph was built with a list of lists of integers, output is a list of lists of integers.
If the graph was built with a list of chord-objects or a chord-line object, output is list of chord objects.
The output is generally connected to the 'chords' input of a 'chordseq' box.
