All paths between two groups of verticesSource:
Finds all paths up to length `maxlen` between specified groups of vertices. This function is needed only becaues igraph`s `all_shortest_paths` finds only the shortest, not any path up to a defined length.
An igraph graph object.
Integer or character vector with the indices or names of one or more start vertices.
Integer or character vector with the indices or names of one or more end vertices.
Character: name of the vertex attribute to identify the vertices by. Necessary if `start` and `end` are not igraph vertex ids but for example vertex names or labels.
Character: IN, OUT or ALL. Default is OUT.
Integer: maximum length of paths in steps, i.e. if maxlen = 3, then the longest path may consist of 3 edges and 4 nodes.
Logical: show a progress bar.
interactions <- import_omnipath_interactions() graph <- interaction_graph(interactions) paths <- find_all_paths( graph = graph, start = c('EGFR', 'STAT3'), end = c('AKT1', 'ULK1'), attr = 'name' )