Search
- Filter Results
- Location
- Classification
- Include attachments
- https://eng.libretexts.org/Bookshelves/Computer_Science/Databases_and_Data_Structures/Data_Structures_(Wikibook)/08%3A_GraphsThey are used to model real-world systems such as the Internet (each node represents a router and each edge represents a connection between routers); airline connections (each node is an airport and e...They are used to model real-world systems such as the Internet (each node represents a router and each edge represents a connection between routers); airline connections (each node is an airport and each edge is a flight); or a city road network (each node represents an intersection and each edge represents a block).
- https://eng.libretexts.org/Bookshelves/Computer_Science/Programming_and_Computation_Fundamentals/Algorithm_Design_and_Analysis_(Justo)/04%3A_Hash_Tables_Graphs_and_Graph_Algorithms/4.02%3A_Activity_2_-_Graphswhile ( S is not empty): // pop a vertex from stack to visit next v = S.top( ) S.pop( ) //push all the neighbours of v in stack that are not visited for all neighbours w of v in Graph G: if w is not v...while ( S is not empty): // pop a vertex from stack to visit next v = S.top( ) S.pop( ) //push all the neighbours of v in stack that are not visited for all neighbours w of v in Graph G: if w is not visited : S.push( w ) mark w as visited DFS-recursive(G, s): mark s as visited for all neighbours w of s in Graph G: if w is not visited: DFS-recursive(G, w)
- https://eng.libretexts.org/Bookshelves/Introductory_Engineering/EGR_1010%3A_Introduction_to_Engineering_for_Engineers_and_Scientists/16%3A_Beyond_the_basics_of_computersThis is just a preview of advanced concepts that might be useful for some disciplines. Here only a taste of the subject is presented, a full-on hard core computer science course would be needed to rea...This is just a preview of advanced concepts that might be useful for some disciplines. Here only a taste of the subject is presented, a full-on hard core computer science course would be needed to really learn these topics. Computer engineers should take those courses. For most these advanced concepts will not be needed but it does not hurt to have the idea in your head just in case.
- https://eng.libretexts.org/Bookshelves/Computer_Science/Applied_Programming/Think_Complexity%3A_Exploring_Complexity_Science_with_Python_(Downey)/02%3A_Graphs/2.02%3A_NetworkXThe 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_graphTo 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.
- https://eng.libretexts.org/Bookshelves/Computer_Science/Databases_and_Data_Structures/Open_Data_Structures_-_An_Introduction_(Morin)/12%3A_GraphsMathematically, a (directed) graph is a pair G=(V,E) where V is a set of vertices and E is a set of ordered pairs of vertices called edges. For example, in a university setting we might ha...Mathematically, a (directed) graph is a pair G=(V,E) where V is a set of vertices and E is a set of ordered pairs of vertices called edges. For example, in a university setting we might have a timetable conflict graph whose vertices represent courses offered in the university and in which the edge (i,j) is present if and only if there is at least one student that is taking both class i and class j.
