Python 3/Google hash code/Slideshow/slideshow.py
def create_adjacency_table(slides):
    """This is used in order to prepare the adjacency table for the dijkstra
    variation that gets the best order for the slides of the slide show"""
    adj_table = []
    i = 0
    while i < len(slides):
        slide_i_adj_values = []
        j = 0
        while j < len(slides):
            slide_i_adj_values.append(pair_value(slides[i], slides[j]))
            j += 1
        adj_table.append(slide_i_adj_values)
        i += 1
    return(adj_table)
This is used in order to prepare the adjacency table for the dijkstra
    variation that gets the best order for the slides of the slide show
This is used in order to prepare the adjacency table for the dijkstra
variation that gets the best order for the slides of the slide show
This is used in order to prepare the adjacency table for the dijkstra variation that gets the best order for the slides of the slide show
def create_adjacency_table(slides):
    adj_table = []
    i = 0
    while i < len(slides):
        slide_i_adj_values = []
        j = 0
        while j < len(slides):
            slide_i_adj_values.append(pair_value(slides[i], slides[j]))
            j += 1
        adj_table.append(slide_i_adj_values)
        i += 1
    return(adj_table)
def create_adjacency_table ( slides ) : adj_table = [ ] i = 0 while i < len ( slides ) : slide_i_adj_values = [ ] j = 0 while j < len ( slides ) : slide_i_adj_values . append ( pair_value ( slides [ i ] , slides [ j ] ) ) j += 1 adj_table . append ( slide_i_adj_values ) i += 1 return ( adj_table )
This is used in order to prepare the adjacency table for the dijkstra
variation that gets the best order for the slides of the slide show
This is used in order to prepare the adjacency table for the dijkstra variation that gets the best order for the slides of the slide show
"""This is used in order to prepare the adjacency table for the dijkstra
    variation that gets the best order for the slides of the slide show"""
slides