def _print_location(ctx, cur_node=None):
"""
Prints the previous log line, current log line and next log line.
The current log line has the tags and ids highlighted. Previous
and next log lines are just printed.
"""
graph = ctx.graph
if not cur_node:
node = ctx.posn
else:
node = cur_node
nbrs = graph[node]
# Grab the previous guy
previous_neighbor = None
next_neighbor = None
for nbr in nbrs:
edge_type = graph[node][nbr].get('edge_type', None)
if edge_type == EdgeType.ADJACENT_PREV:
previous_neighbor = nbr
elif edge_type == EdgeType.ADJACENT_NEXT:
next_neighbor = nbr
if previous_neighbor:
print previous_neighbor
print format_vertex(node)
if next_neighbor:
print next_neighbor
def _print_neighbors(ctx, cur_node=None):
if cur_node is None:
node = ctx.posn
else:
node = cur_node
nbrs = ctx.sorted_neighbors(node)
print '_' * 10
for i, nbr in enumerate(nbrs):
print "%d %s" % (i,
shorten_color_str(format_vertex(nbr), 80))
_print_most_likely_paths(ctx, nbr)
