Accompanying implementation by Robert Sedgewick and Kevin Wayne, explicitly credited by the source file’s author tags, for Algorithms, 4th edition by Robert Sedgewick and others. GitHub hosts the inspected source. The textbook publication year is 2011; no source-file publication date is established, and the copyright range is a separate date role.
Inspected locators: class documentation and author tags; constructor; relax and check methods; textbook attribution footer. This is the queue implementation.
Cited passages: BipartiteX.java, class documentation: breadth-first search, linear construction time and vertex-linear extra space; bfs method: odd-cycle reconstruction; BipartiteX.java, constructor component loop and bfs method: discovery colours, parent pointers and same-colour conflict.
Authored accompanying software by Robert Sedgewick and Kevin Wayne, identified by the implementation bylines. The book publication year is 2011; copyright 2002–2025 is not an implementation publication date. Implementation locators refer to the inspected source file, not to the textbook pages.
Cited passages: Graph.java, class documentation and fields: vertex-indexed adjacency collections; addEdge: entries at both endpoints; Graph.java, class documentation: parallel edges and two-entry undirected self-loop convention; addEdge applies both insertions even when v equals w.
Authored accompanying software by Robert Sedgewick and Kevin Wayne, identified by the implementation bylines. The book publication year is 2011; copyright 2002–2025 is not an implementation publication date. Implementation locators refer to the inspected source file, not to the textbook pages.
Cited passages: Digraph.java, addEdge, adj and outdegree: one entry in the tail's collection; indegree is maintained separately; Digraph.java, class documentation and addEdge: parallel edges permitted; a directed self-loop adds one outgoing entry and increments indegree once; Digraph.java, class documentation and adj: obtaining the collection versus iterating in time proportional to outdegree.
Accompanying software for Algorithms, 4th edition by Robert Sedgewick and others, authored by Robert Sedgewick and Kevin Wayne, both named in the implementation bylines. GitHub hosts their algs4 repository. The footer gives 2011 as the textbook publication year; its copyright interval does not date the implementation. These locators refer to the inspected software rather than to textbook pages.
Cited passages: Browser lines 0–3: class documentation, directed endpoints, real-valued capacity and flow, @author declarations.; Browser lines 4–6: constructors enforce nonnegative capacity and flow bounded between zero and capacity.; Browser lines 11–13: actual residualCapacityTo and addResidualFlowTo bodies distinguish forward capacity-minus-flow and backward flow.; Browser lines 14–16: footer credits whole-book authors, publisher and 2011 publication year..
Accompanying software for Algorithms, 4th edition by Robert Sedgewick and others, authored by Robert Sedgewick and Kevin Wayne, both named in the implementation bylines. GitHub hosts their algs4 repository. The footer gives 2011 as the textbook publication year; its copyright interval does not date the implementation. These locators refer to the inspected software rather than to textbook pages.
Cited passages: Lines 12–35: maximum-flow/minimum-cut purpose and explicit implementation authors.; Lines 138–177: excess computes incoming minus outgoing edge amounts; isFeasible checks capacity constraints and conservation at nonterminal vertices.; Lines 180–209: check verifies feasibility, s-in/t-out membership, forward-only cut capacity sum and equality with flow value.; Lines 246–252: copyright interval and accompanying book authors, publisher, 2011 publication year..
Accompanying software for Algorithms, 4th edition by Robert Sedgewick and others, authored by Robert Sedgewick and Kevin Wayne, as credited in the implementation. GitHub hosts the author repository. The footer identifies 2011 as textbook publication; no implementation publication or revision date is established.
Cited passages: class documentation lines 39–68: signed weights, ties, minimum spanning forest, union-find, sorting complexity, author tags; constructor lines 79–100: sort, representative queries, merges, n-1 stopping condition; footer lines 194–199: textbook metadata.
Accompanying software for Algorithms, 4th edition by Robert Sedgewick and others, authored by Robert Sedgewick and Kevin Wayne, as credited in the implementation. GitHub hosts the author repository. The footer identifies 2011 as textbook publication; no implementation publication or revision date is established.
Cited passages: class documentation lines 13–60: partition, representatives, operations, union by size without path compression, logarithmic operation bound and authors; union method lines 135–148: smaller root attaches below larger root.
Accompanying software for Algorithms, 4th edition by Robert Sedgewick and others, credited to Robert Sedgewick and Kevin Wayne in its author declarations. GitHub hosts the author repository. The footer’s 2011 date identifies the textbook publication; the software has no established publication or revision date.
Cited passages: class documentation, lines 25–77; constructor, lines 92–100; find, lines 109–115; union, lines 149–160. The implementation uses path compression by halving.

Ancestors (3)

  1. Mathematics bibliography
  2. Mathematics
  3. Home

Incoming links (6)

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version