Index of values

Add edge with no edgeway

Add new node with no extra information, number will be invalid

Function that lists all Backward edges in a tree

Boolean function to check if the last element in cycle list is unstrict

Function that chooses and performs next step in cycle

Function that cleans tree from all extra information before starting to build the tree again, also it corrects all info about nodes children and input nodes

Create a tree with just information about the graph

Depth first search for fixing node numbers and edeways

Function that creates first tree

Debugging method, returns string representation of edge

Function that maps all edges in a tree, that the filter function allows, to a list

Get a (connectiontype,NewName.idtype,portname) list of all edges in graph

Get a (connectiontype,nodetype,portname) list of all edges in graph

A tree with no nodes and edges

Finds nodetype list of all input nodes, input nodes are the ones that hav no incoming edges

Finds all interesting cycles in a tree

Function to find an edge between given nodes, works only if an edge is present

Finds next cycle for transformation.

Find all cycles that contain one Backward edge and Normal edges

Function to find an edge whose target and source are both unstrict nodes

Function to find an edge with given id

Function to find a node with given id

NodeNumber element from integer

returns integer of string

function that returns the next available number

Function that makes a DG.t type graph from tree

Boolean function to check if cycle has MUX nodes

Boolean function to check if cycle has unctrict nodes

Function to to check if an edge between given nodes exists,

Boolean function to check if cycle has multiple unstrict nodes

Boolean function to check if cycle has edge whose target and source are both unstrict nodes

Boolean function to check if cycle has exactly one MUX node

Boolean function to check if cycle has exactly one Or node

Boolean function to check if cycle has Or nodes

Boolean function to check if a tree has an edge with certain id

Boolean function to check if a tree has a node with certain id

invalid_id returns 0, that is newer returned by function get

Boolean function to check if a node has no incoming edges

Boolean function to check if given node is MUX (ShortMux)

Boolean function to check if given node is unstrict

Boolean function to check if given node is Or

Boolean function to check if there is a path of Normal edges from parent to child, checks if parent node id indeed a parent of child node

Get tree with added edges

Get tree with graph nodes without extra information

Give node the next available number

Function tat makes constant lable map for an edge

Function that fixes new source node for all edges in a list, does not change edge id

Function that cleans and builds new depth first search tree based on given tree

Debugging method, returns string representation of node

Find a list of nodes that have Normal edges between them and normal path connects edgeend_id and findal_id, path is searched starting from below

Part of Move Over Or transformation for cases where target node is And

Part of Move Over Or transformation for cases where target node has bitstring output

Part of Move Over Or transformation for cases where target node is LongOr

Menu name and position information

Menu name and position information

Rearrange tree so that nodes in chosen cycle are all in the leftmost branch of the subtree

Function to rearrange tree after GrbTrCutStrictCycle transformation.

Function to rearrange tree and find new cycle after GrbTrFuseTwoAndOr (and MoveOverOr for Or case) transformation.

Function to rearrange tree and find new cycle after GrbTrPassOverId transformation.

Function to rearrange tree and find new cycle after GrbTrMoveOverMux, GrbTrMoveOverDtoCMUX and MoveOverOr for And and LongOr cases transformations.

Function to rearrange tree and find new cycle after MoveOverOr transformation.

resets the next id to restart the numbering from somewhere

First cycle removing method that checks id there are any cycles

Main cycle of the transformation.

Logging and debugging method, writes information about transformation to special file

returns string representation of NodeNumber

Main transformation function is called if the transformation is used

Main transformation function is called if the transformation is used

Boolean function to check if the upper node (exept the node where backward input goes to) is Or

Function to find an upper edge in cycle that starts from MUX

Function to find an upper edge in cycle that starts from Or

Fix edgeway and that an edge has been used

Fix that we have seen all edges going out from this node

Depth first search method for determining what to do with given node - see another out edge or fix that all have been seen