StanfordCPPLib
BigOh
Member BasicGraphGen< V, E >::addEdge (string v1, string v2, double cost=0.0, bool directed=true)
O(log V + log E)
Member BasicGraphGen< V, E >::addEdge (VertexGen< V, E > *v1, VertexGen< V, E > *v2, double cost=0.0, bool directed=true)
O(log V + log E)
Member BasicGraphGen< V, E >::addEdge (EdgeGen< V, E > *e, bool directed=true)
O(log V + log E)
Member BasicGraphGen< V, E >::addVertex (string name)
O(log V)
Member BasicGraphGen< V, E >::addVertex (VertexGen< V, E > *v)
O(log V)
Member BasicGraphGen< V, E >::BasicGraphGen (std::initializer_list< string > vertexList)
O(V)
Member BasicGraphGen< V, E >::BasicGraphGen ()
O(1)
Member BasicGraphGen< V, E >::clearEdges ()
O(E log E)
Member BasicGraphGen< V, E >::clearEdges (VertexGen< V, E > *v)

O(E log E)

O(log V + E)

Member BasicGraphGen< V, E >::clearEdges (string v)
O(E log E)
Member BasicGraphGen< V, E >::containsEdge (VertexGen< V, E > *v1, VertexGen< V, E > *v2) const
O(log E)
Member BasicGraphGen< V, E >::containsEdge (string v1, string v2) const
O(log E)
Member BasicGraphGen< V, E >::containsEdge (EdgeGen< V, E > *edge) const
O(log E)
Member BasicGraphGen< V, E >::containsVertex (string name) const
O(log V)
Member BasicGraphGen< V, E >::containsVertex (VertexGen< V, E > *v) const
O(log V)
Member BasicGraphGen< V, E >::edgeCount () const
O(log V)
Member BasicGraphGen< V, E >::getEdge (VertexGen< V, E > *v1, VertexGen< V, E > *v2) const
O(log V + log E)
Member BasicGraphGen< V, E >::getEdge (string v1, string v2) const
O(log V + log E)
Member BasicGraphGen< V, E >::getEdgeSet () const
O(1)
Member BasicGraphGen< V, E >::getEdgeSet (VertexGen< V, E > *v) const
O(1)
Member BasicGraphGen< V, E >::getEdgeSet (string v) const
O(1)
Member BasicGraphGen< V, E >::getInverseArc (EdgeGen< V, E > *edge) const
O(E)
Member BasicGraphGen< V, E >::getInverseEdge (EdgeGen< V, E > *edge) const
O(E)
Member BasicGraphGen< V, E >::getInverseEdgeSet (VertexGen< V, E > *v) const
O(E)
Member BasicGraphGen< V, E >::getInverseEdgeSet (string v) const
O(E)
Member BasicGraphGen< V, E >::getVertex (string name) const
O(log V)
Member BasicGraphGen< V, E >::getVertexNames () const
O(V log V)
Member BasicGraphGen< V, E >::getVertexSet () const
O(V log V)
Member BasicGraphGen< V, E >::operator[] (string name)
O(log V)
Member BasicGraphGen< V, E >::operator[] (string name) const
O(log V)
Member BasicGraphGen< V, E >::removeEdge (string v1, string v2, bool directed=true)
O(E + log V)
Member BasicGraphGen< V, E >::removeEdge (VertexGen< V, E > *v1, VertexGen< V, E > *v2, bool directed=true)
O(E + log V)
Member BasicGraphGen< V, E >::removeEdge (EdgeGen< V, E > *e, bool directed=true)
O(log E + log V)
Member BasicGraphGen< V, E >::removeVertex (string name)
O(E + log V)
Member BasicGraphGen< V, E >::removeVertex (VertexGen< V, E > *v)
O(E + log V)
Member BasicGraphGen< V, E >::toMap () const
O(V + E)
Member BasicGraphGen< V, E >::vertexCount () const
O(1)
Member Graph< NodeType, ArcType >::addArc (string n1, string n2)
O(log V + log E)
Member Graph< NodeType, ArcType >::addArc (NodeType *n1, NodeType *n2)
O(log V + log E)
Member Graph< NodeType, ArcType >::addArc (ArcType *arc)
O(log V + log E)
Member Graph< NodeType, ArcType >::addNode (string name)
O(log V)
Member Graph< NodeType, ArcType >::addNode (NodeType *node)
O(log V)
Member Graph< NodeType, ArcType >::arcCount () const
O(1)
Member Graph< NodeType, ArcType >::back () const
O(1)
Member Graph< NodeType, ArcType >::begin () const
O(1)
Member Graph< NodeType, ArcType >::clear ()
O(V + E)
Member Graph< NodeType, ArcType >::clearArcs ()
O(E)
Member Graph< NodeType, ArcType >::clearArcs (NodeType *node)
O(log V + E)
Member Graph< NodeType, ArcType >::clearArcs (string name)
O(E log E)
Member Graph< NodeType, ArcType >::containsArc (NodeType *node1, NodeType *node2) const
O(log E)
Member Graph< NodeType, ArcType >::containsArc (string node1, string node2) const
O(log E)
Member Graph< NodeType, ArcType >::containsArc (ArcType *arc) const
O(log E)
Member Graph< NodeType, ArcType >::containsNode (string name) const
O(log V)
Member Graph< NodeType, ArcType >::containsNode (NodeType *node) const
O(log V)
Member Graph< NodeType, ArcType >::end () const
O(1)
Member Graph< NodeType, ArcType >::equals (const Graph< NodeType, ArcType > &graph2) const
O(V log V + E log E)
Member Graph< NodeType, ArcType >::front () const
O(1)
Member Graph< NodeType, ArcType >::getArc (NodeType *node1, NodeType *node2) const
O(log V + log E)
Member Graph< NodeType, ArcType >::getArc (string node1, string node2) const
O(log V + log E)
Member Graph< NodeType, ArcType >::getArcSet () const
O(1)
Member Graph< NodeType, ArcType >::getArcSet (NodeType *node) const
O(1)
Member Graph< NodeType, ArcType >::getArcSet (string name) const
O(1)
Member Graph< NodeType, ArcType >::getInverseArcSet (string name) const
O(E)
Member Graph< NodeType, ArcType >::getInverseArcSet (NodeType *node) const
O(E)
Member Graph< NodeType, ArcType >::getInverseNeighborNames (NodeType *node) const
O(E)
Member Graph< NodeType, ArcType >::getInverseNeighborNames (string node) const
O(E)
Member Graph< NodeType, ArcType >::getInverseNeighbors (NodeType *node) const
O(E)
Member Graph< NodeType, ArcType >::getInverseNeighbors (string node) const
O(E)
Member Graph< NodeType, ArcType >::getNeighborNames (NodeType *node) const
O(log V)
Member Graph< NodeType, ArcType >::getNeighborNames (string node) const
O(log V)
Member Graph< NodeType, ArcType >::getNeighbors (NodeType *node) const
O(log V)
Member Graph< NodeType, ArcType >::getNeighbors (string node) const
O(log V)
Member Graph< NodeType, ArcType >::getNode (string name) const
O(log V)
Member Graph< NodeType, ArcType >::getNodeNames () const
O(V log V)
Member Graph< NodeType, ArcType >::getNodeSet () const
O(1)
Member Graph< NodeType, ArcType >::Graph ()=default
O(1)
Member Graph< NodeType, ArcType >::isConnected (string s1, string s2) const
O(log V)
Member Graph< NodeType, ArcType >::isConnected (NodeType *n1, NodeType *n2) const
O(log V)
Member Graph< NodeType, ArcType >::isEmpty () const
O(1)
Member Graph< NodeType, ArcType >::isNeighbor (NodeType *node1, NodeType *node2) const
O(log V)
Member Graph< NodeType, ArcType >::isNeighbor (string node1, string node2) const
O(log V)
Member Graph< NodeType, ArcType >::nodeCount () const
O(1)
Member Graph< NodeType, ArcType >::operator!= (const Graph &graph2) const
O(V log V + E log E)
Member Graph< NodeType, ArcType >::operator< (const Graph &graph2) const
O(V log V + E log E)
Member Graph< NodeType, ArcType >::operator<= (const Graph &graph2) const
O(V log V + E log E)
Member Graph< NodeType, ArcType >::operator== (const Graph &graph2) const
O(V log V + E log E)
Member Graph< NodeType, ArcType >::operator> (const Graph &graph2) const
O(V log V + E log E)
Member Graph< NodeType, ArcType >::operator>= (const Graph &graph2) const
O(V log V + E log E)
Member Graph< NodeType, ArcType >::removeArc (string s1, string s2)
O(E + log V)
Member Graph< NodeType, ArcType >::removeArc (NodeType *n1, NodeType *n2)
O(E + log V)
Member Graph< NodeType, ArcType >::removeArc (ArcType *arc)
O(log E + log V)
Member Graph< NodeType, ArcType >::removeNode (string name)
O(E + log V)
Member Graph< NodeType, ArcType >::removeNode (NodeType *node)
O(E + log V)
Member Graph< NodeType, ArcType >::size () const
O(1)
Member Graph< NodeType, ArcType >::toString () const
O(V + E)
Member Graph< NodeType, ArcType >::~Graph ()
O(V + E)
Member Vector< ValueType >::add (const ValueType &value)
O(1)
Member Vector< ValueType >::addAll (const Vector< ValueType > &v)
O(N)
Member Vector< ValueType >::back ()
O(1)
Member Vector< ValueType >::back () const
O(1)
Member Vector< ValueType >::clear ()
O(1)
Member Vector< ValueType >::contains (const ValueType &value) const
O(N)
Member Vector< ValueType >::ensureCapacity (int cap)
O(N)
Member Vector< ValueType >::equals (const Vector< ValueType > &v) const
O(N)
Member Vector< ValueType >::front () const
O(1)
Member Vector< ValueType >::front ()
O(1)
Member Vector< ValueType >::get (int index) const
O(1)
Member Vector< ValueType >::indexOf (const ValueType &value) const
O(N)
Member Vector< ValueType >::insert (int index, const ValueType &value)
O(N)
Member Vector< ValueType >::isEmpty () const
O(1)
Member Vector< ValueType >::lastIndexOf (const ValueType &value) const
O(N)
Member Vector< ValueType >::mapAll (std::function< void(const ValueType &)> fn) const
O(N)
Member Vector< ValueType >::operator!= (const Vector &v2) const
O(N)
Member Vector< ValueType >::operator+ (const ValueType &elem) const
O(N)
Member Vector< ValueType >::operator+ (const Vector &v2) const
O(N)
Member Vector< ValueType >::operator+= (const Vector &v2)
O(N)
Member Vector< ValueType >::operator+= (const ValueType &value)
O(1)
Member Vector< ValueType >::operator, (const ValueType &value)
O(1)
Member Vector< ValueType >::operator< (const Vector &v2) const
O(N)
Member Vector< ValueType >::operator<= (const Vector &v2) const
O(N)
Member Vector< ValueType >::operator== (const Vector &v2) const
O(N)
Member Vector< ValueType >::operator> (const Vector &v2) const
O(N)
Member Vector< ValueType >::operator>= (const Vector &v2) const
O(N)
Member Vector< ValueType >::operator[] (int index)
O(1)
Member Vector< ValueType >::operator[] (int index) const
O(1)
Member Vector< ValueType >::pop_back ()
O(1)
Member Vector< ValueType >::pop_front ()
O(N)
Member Vector< ValueType >::push_back (const ValueType &value)
O(1)
Member Vector< ValueType >::push_front (const ValueType &value)
O(N)
Member Vector< ValueType >::remove (int index)
O(N)
Member Vector< ValueType >::removeBack ()
O(1)
Member Vector< ValueType >::removeFront ()
O(N)
Member Vector< ValueType >::removeValue (const ValueType &value)
O(N)
Member Vector< ValueType >::reverse ()
O(N)
Member Vector< ValueType >::set (int index, const ValueType &value)
O(1)
Member Vector< ValueType >::shuffle ()
O(N)
Member Vector< ValueType >::size () const
O(1)
Member Vector< ValueType >::sort ()
O(N log N)
Member Vector< ValueType >::subList (int start, int length) const
O(N)
Member Vector< ValueType >::subList (int start) const
O(N)
Member Vector< ValueType >::toString () const
O(N)
Member Vector< ValueType >::Vector (std::initializer_list< ValueType > list)
O(N)
Member Vector< ValueType >::Vector (int n, ValueType value=ValueType())
O(N)
Member Vector< ValueType >::Vector ()=default
O(1)
Member Vector< ValueType >::~Vector ()=default
O(1)