Loading [MathJax]/extensions/mml2jax.js
Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Engineering LibreTexts

Search

  • Filter Results
  • Location
  • Classification
    • Article type
    • Author
    • Set as Cover Page of Book
    • License
    • Show TOC
    • Transcluded
    • OER program or Publisher
    • Autonumber Section Headings
    • License Version
    • Print CSS
  • Include attachments
Searching in
About 4 results
  • https://eng.libretexts.org/Bookshelves/Computer_Science/Databases_and_Data_Structures/Data_Structures_(Wikibook)/01%3A_Introduction/1.01%3A_The_Node
    In still other languages, the decision of the type of the contained element can be delayed until the type is actually used (as in languages that support generic types, like C++ and Java). // Create a ...In still other languages, the decision of the type of the contained element can be delayed until the type is actually used (as in languages that support generic types, like C++ and Java). // Create a new node, with v as its contained value and next as // the value of the next pointer function make-node(v, node next): node let result := new node {v, next} return result end
  • https://eng.libretexts.org/Bookshelves/Computer_Science/Databases_and_Data_Structures/Data_Structures_(Wikibook)/06%3A_Trees/6.05%3A_Binary_Search_Trees
    If the item that you are searching for is less than the root node, move to the left child of the root node, if the item that you are searching for is more than the root node, move to the right child o...If the item that you are searching for is less than the root node, move to the left child of the root node, if the item that you are searching for is more than the root node, move to the right child of the root node and if it is equal to the root node, then you have found the item that you are looking for.
  • https://eng.libretexts.org/Bookshelves/Computer_Science/Applied_Programming/Think_Complexity%3A_Exploring_Complexity_Science_with_Python_(Downey)/02%3A_Graphs/2.02%3A_NetworkX
    The option with_labels causes the nodes to be labeled; in the next example we’ll see how to label the edges. Instead of draw_circular, which arranges the nodes in a circle, I’ll use draw, which takes ...The option with_labels causes the nodes to be labeled; in the next example we’ll see how to label the edges. Instead of draw_circular, which arranges the nodes in a circle, I’ll use draw, which takes the position dictionary as the second parameter: The edge_labels parameter expects a dictionary that maps from each pair of nodes to a label; in this case, the labels are driving times between cities.
  • https://eng.libretexts.org/Bookshelves/Computer_Science/Applied_Programming/Think_Complexity%3A_Exploring_Complexity_Science_with_Python_(Downey)/02%3A_Graphs/2.01%3A_What_is_a_graph
    To most people a “graph" is a visual representation of data, like a bar chart or a plot of stock prices over time. In a road map, you might represent a one-way street with a directed edge and a two-wa...To most people a “graph" is a visual representation of data, like a bar chart or a plot of stock prices over time. In a road map, you might represent a one-way street with a directed edge and a two-way street with an undirected edge. In this example the placement of the nodes corresponds roughly to the geography of the cities, but in general the layout of a graph is arbitrary.

Support Center

How can we help?