Visual complexity slider for process graphs

Abstract

Systems and methods for filtering a process graph are provided. Paths in a process graph representing execution of a process are identified. A measure of importance is calculated for each of the identified paths. The identified paths are sorted based on the calculated measures of importance. The process graph is filtered according to a level of complexity based on the sorted identified paths. The filtered process graph is output.

What is claimed is: 
     
         1 . A computer implemented method comprising:
 identifying paths in a process graph representing execution of a process;   calculating a measure of importance for each of the identified paths;   sorting the identified paths based on the calculated measures of importance;   filtering the process graph according to a level of complexity based on the sorted identified paths; and   outputting the filtered process graph.   
     
     
         2 . The computer implemented method of  claim 1 , wherein the level of complexity is defined based on user input received via a slider. 
     
     
         3 . The computer implemented method of  claim 1 , further comprising automatically determining the level of complexity by:
 identifying a smallest set of the sorted identified paths, starting at a top of the sorted identified paths, with a combined number of edges greater than a predetermined minimal number of edges; and   adding each next respective path to the identified set until either 1) the measure of importance of the next respective path is less than a measure of importance of a first path of the sorted identified paths multiplied by a predetermined importance factor or 2) a combined number of edges will exceed a predetermined maximal number of edges if the next respective path is added.   
     
     
         4 . The computer implemented method of  claim 1 , wherein filtering the process graph according to a level of complexity based on the sorted identified paths comprises:
 filtering the process graph to show top paths of the sorted identified paths, wherein the top paths are determined based on the level of complexity.   
     
     
         5 . The computer implemented method of  claim 1 , wherein identifying paths in a process graph representing execution of a process:
 iteratively traversing each untraversed edge in the process graph with a highest frequency of execution until an end node of the process graph is reached or a previously traversed node of the process graph is reached; and   for each respective iteration, identifying the untraversed edges, traversed during the respective iteration, as a path.   
     
     
         6 . The computer implemented method of  claim 1 , wherein calculating a measure of importance for each of the identified paths comprises:
 calculating the measure of importance for each of the identified paths based on frequencies of execution of edges of each of the identified paths.   
     
     
         7 . The computer implemented method of  claim 6 , wherein calculating the measure of importance for each of the identified paths based on frequencies of execution of edges of each of the identified paths comprises:
 calculating the measure of importance for each of the identified paths as a sum of the frequencies of execution of edges of each of the identified paths.   
     
     
         8 . The computer implemented method of  claim 1 , wherein sorting the identified paths based on the calculated measures of importance comprises:
 sorting the identified paths in descending order based on the calculated measures of importance.   
     
     
         9 . The computer implemented method of  claim 1 , wherein the process is an RPA (robotic process automation) process. 
     
     
         10 . An apparatus comprising:
 a memory storing computer instructions; and   at least one processor configured to execute the computer instructions, the computer instructions configured to cause the at least one processor to perform operations of:   identifying paths in a process graph representing execution of a process;   calculating a measure of importance for each of the identified paths;   sorting the identified paths based on the calculated measures of importance;   filtering the process graph according to a level of complexity based on the sorted identified paths; and   outputting the filtered process graph.   
     
     
         11 . The apparatus of  claim 10 , wherein the level of complexity is defined based on user input received via a slider. 
     
     
         12 . The apparatus of  claim 10 , the operations further comprising automatically determining the level of complexity by:
 identifying a smallest set of the sorted identified paths, starting at a top of the sorted identified paths, with a combined number of edges greater than a predetermined minimal number of edges; and   adding each next respective path to the identified set until either 1) the measure of importance of the next respective path is less than a measure of importance of a first path of the sorted identified paths multiplied by a predetermined importance factor or 2) a combined number of edges will exceed a predetermined maximal number of edges if the next respective path is added.   
     
     
         13 . The apparatus of  claim 10 , wherein filtering the process graph according to a level of complexity based on the sorted identified paths comprises:
 filtering the process graph to show top paths of the sorted identified paths, wherein the top paths are determined based on the level of complexity.   
     
     
         14 . The apparatus of  claim 10 , wherein identifying paths in a process graph representing execution of a process:
 iteratively traversing each untraversed edge in the process graph with a highest frequency of execution until an end node of the process graph is reached or a previously traversed node of the process graph is reached; and   for each respective iteration, identifying the untraversed edges, traversed during the respective iteration, as a path.   
     
     
         15 . A computer program embodied on a non-transitory computer-readable medium, the computer program configured to cause at least one processor to perform operations comprising:
 identifying paths in a process graph representing execution of a process;   calculating a measure of importance for each of the identified paths;   sorting the identified paths based on the calculated measures of importance;   filtering the process graph according to a level of complexity based on the sorted identified paths; and   outputting the filtered process graph.   
     
     
         16 . The computer program of  claim 15 , wherein the level of complexity is defined based on user input received via a slider. 
     
     
         17 . The computer program of  claim 15 , wherein calculating a measure of importance for each of the identified paths comprises:
 calculating the measure of importance for each of the identified paths based on frequencies of execution of edges of each of the identified paths.   
     
     
         18 . The computer program of  claim 17 , wherein calculating the measure of importance for each of the identified paths based on frequencies of execution of edges of each of the identified paths comprises:
 calculating the measure of importance for each of the identified paths as a sum of the frequencies of execution of edges of each of the identified paths.   
     
     
         19 . The computer program of  claim 15 , wherein sorting the identified paths based on the calculated measures of importance comprises:
 sorting the identified paths in descending order based on the calculated measures of importance.   
     
     
         20 . The computer program of  claim 15 , wherein the process is an RPA (robotic process automation) process.