In contrast, for arbitrary graphs the shortest path may require slower algorithms such as Dijkstra's algorithm or the Bellman–Ford algorithm, and longest paths in arbitrary graphs are NP-hard to find.
Unlike the other tools, in Compendium the composite hierarchy does not form a DAG, but rather an arbitrary graph: view A can appear on view B, and B can in turn appear on A. The user's intuitive notion of "inside" must be adapted somewhat in this case.
directed | Graph of a function | graph | Bipartite graph | planar graph | graph theory | directed graph | Directed-energy weapon | Under Graph | random graph | Planar graph | Graph traversal | Graph theory | Graph (mathematics) | Gabriel graph | ''What's Wrong With Angry?'' Poster for the 2008 Edinburgh Fringe production directed by Patrick Wilde | visibility graph | Unit distance graph | Shia LaBeouf in the video for "Fjögur Píanó" directed by Alma Har'el | Scene from '''Stanley Keyes''' play ''Dragon Slayers,'' directed by Brad Mays | rook's graph | Rado graph | minor (graph theory) | Lattice graph | interval graph | Graph-tool | Graph (data structure) | Graph coloring | graph coloring | Graph |