Global

Methods

addNeighbour(source, target)

addNeighbour adds the given nodes respectively to their list of neighbours (used for edges with source and target node). adds source node to target's neighbours and vice versa
Parameters:
Name Type Description
source source node of the edge
target target node of the edge
Source:

createConfluent(graph, cola)

createConfluent creates and draws routing graph, confluent drawing and confluent drawing without crossings
Parameters:
Name Type Description
graph the graph to visualize
cola cola d3 adaptor
Source:

createGraph(graph)

createGraph creates the visualization of the original graph
Parameters:
Name Type Description
graph the graph to be drawn as node- and edgelist
Source:

createRoutingGraph(powerGraph, nodes, edges, neighbours, neighbIn, n)

createRoutingGraph creates node- and edge-list for the routing graph taking the informations stored in powergraph, also creates neighbourlist for all nodes in routing graph and records incoming edges of routing nodes
Parameters:
Name Type Description
powerGraph the powergraph used to create the routing graph
nodes a list of graph nodes, routing nodes will be added to the list
edges an empty list where routing edges will be added
neighbours an empty list which will be filled with neighbours of all nodes
neighbIn an empty list which will be filled with incoming neighbours for all routing nodes
n number of graph nodes
Source:

loadGraph(selectedValue)

loadGraph loads graph from JSON file according to the selected graph from the dropdown list
Parameters:
Name Type Description
selectedValue name of the chosen graph to be loaded
Source:

onChange()

onChange is called when an item from the dropdown list is klicked, removes drawn graphs and resets zoom before new graph is loaded
Source:

shortestPath(neigh, edge, n)

shortestPath finds shortest path in routing graph for edge in original graph, returns path as array of node indices
Parameters:
Name Type Description
neigh the list of neighbours for each node
edge the edge containing source and target node, the path is found from source to target
n number of nodes
Source:
Returns:
path from source to target, as list of node indices, containing only routing nodes between source and target node

splitGraphNodes(neighbIn, neighbours, splitNodes, splitNeighb, splitEdges, n, nodes)

splitGraphNodes splits routing nodes with more than 1 incoming and more than 1 outgoing edge. adjusts neighbour-, node- and edgelist according to splits
Parameters:
Name Type Description
neighbIn list with incoming neighbours for all routing nodes
neighbours total list of neighbours for each node
splitNodes list with all graph- and routing nodes, new split nodes will be added to that list
splitNeighb same as neighbIn, but the list will be adjustet to the node splits, neighbours will be added or deleted
splitEdges list with edges from the routing graph, will be adjustet to node splits, edges will be added or deleted
n number of graph nodes
nodes list of graph nodes
Source:

zoomed()

zoomed is used to zoom the first graph
Source:

zoomed2()

zoomed2 is used to zoom the second graph
Source:

zoomed3()

zoomed3 is used to zoom the third graph
Source:

zoomed4()

zoomed2 is used to zoom the second graph
Source: