Minor refactor of Dijkstra behavior and added a function to the algorithm to traverse with consideration to edge weights
Changed setAttrs() to accept an Element instead of element.data() as its parameter.
Gave the Email Viewer window an ID so it can be treated as a singleton if desired
Fixed a minor problem with path-finding based on edge weight.
Duplicate edges will no longer appear when expanding on a node with results
Made the path-finding algorithm return a default weight of 1 if "weight" is undefined or <= 0
Initial Graph Generation capability