operations_research::RootedTree< NodeType > Member List

This is the complete list of members for operations_research::RootedTree< NodeType >, including all inherited members.

AllDepths() const	operations_research::RootedTree< NodeType >	inline
AllDepths(absl::Span< const NodeType > topological_order) const	operations_research::RootedTree< NodeType >
AllDistancesToRoot(absl::Span< const T > arc_lengths) const	operations_research::RootedTree< NodeType >
AllDistancesToRoot(absl::Span< const T > arc_lengths, absl::Span< const NodeType > topological_order) const	operations_research::RootedTree< NodeType >
Create(NodeType root, std::vector< NodeType > parents, std::vector< NodeType > *error_cycle=nullptr, std::vector< NodeType > *topological_order=nullptr)	operations_research::RootedTree< NodeType >	static
Distance(NodeType start, NodeType end, NodeType lca, absl::Span< const double > arc_lengths) const	operations_research::RootedTree< NodeType >
DistanceAndPath(NodeType start, NodeType end, NodeType lca, absl::Span< const double > arc_lengths) const	operations_research::RootedTree< NodeType >
DistanceAndPathToRoot(NodeType start, absl::Span< const double > arc_lengths) const	operations_research::RootedTree< NodeType >
DistanceOfPath(absl::Span< const NodeType > path, absl::Span< const double > arc_lengths) const	operations_research::RootedTree< NodeType >
DistanceToRoot(NodeType start, absl::Span< const double > arc_lengths) const	operations_research::RootedTree< NodeType >
Evert(NodeType new_root)	operations_research::RootedTree< NodeType >
kNullParent	operations_research::RootedTree< NodeType >	static
LowestCommonAncestorByDepth(NodeType n1, NodeType n2, absl::Span< const NodeType > depths) const	operations_research::RootedTree< NodeType >
LowestCommonAncestorBySearch(NodeType n1, NodeType n2, std::vector< bool > &visited_workspace) const	operations_research::RootedTree< NodeType >
num_nodes() const	operations_research::RootedTree< NodeType >	inline
parents() const	operations_research::RootedTree< NodeType >	inline
Path(NodeType start, NodeType end, NodeType lca) const	operations_research::RootedTree< NodeType >
PathFromRoot(NodeType node) const	operations_research::RootedTree< NodeType >
PathToRoot(NodeType node) const	operations_research::RootedTree< NodeType >
root() const	operations_research::RootedTree< NodeType >	inline
RootedTree(NodeType root, std::vector< NodeType > parents)	operations_research::RootedTree< NodeType >	inlineexplicit
TopologicalSort() const	operations_research::RootedTree< NodeType >