# Homework Library

A Discrete-Time Event Simulator for Distance Vector Routing
\$15.00
Computer Science
Programming
Event Simulator
Distances
Vectors
Routing
Convergence
Network Topologies
Packets
Tables
Nodes
Neighbors
Debugging
Commands
Dijkstra's Algorithm in Java
\$18.00
Computer Science
Programming
Dijkstra's Algorithm
Java
Vertices
Letters
Weights
Distances
Columns
Arguments
C++ Programming: Travel Times For Predefined Trips
\$40.00
Computer Science
C++ Programming
Predefined Trips
Travel Time
Distances
Users
Functions
Classes
Compiling
Statements
Object-Oriented Programming
5 Algorithm Design Problems Involving Greedy, Sorting, Graphs (Minimum Spanning Trees)
\$63.00
Greedy
Graph
MST
Minimum
Spanning
Tree
Edge
Undirected
Polynomial
Time
Algorithm
Account
Weight
Array
Sort
Median
Minimum
Stop
Gas
Station
3 Classical Algorithms Involving Greedy and Dynamic Programming
\$33.00
Knapsack
Actvity
Selection
Job
Scheduling
Proof
Correctness
Integer
Greedy
Choice
Dynamic
Programming
Compatible
Maximum
Earliest
Duration
Overlap
Start
Time
Item
Weight
Profit
Optimal
Solution
Complexity
Recurrence
Substru
Solid State Physics Questions
\$20.00
Solid
State
Physics
Questions
Crystal
Pennies
Diameter
Distance
Sums
Terms
Four Problems Involving Floyd-Warshall Algorithm and Reflexive-Transitive Closure
\$50.00
Matrix
Floyd
Warshall
Algorithm
Path
Length
Reflexive
Transitive
Closure
Row
Column
Order
Graph
Weight
Directed
Condensation
Vertices
Loop
Pass
Topological
Iteration
Connected
Component
Strong
Numerical Analysis Questions
\$23.00
Mathematics
Numerical Analysis
Linear Systems
Matlab
Splines
Interpolation
Curves
Parameters
Points
Distances
Functions
Topology Question
\$3.00
Mathematics
Topology
Boundaries
Closures
Convergence
Distances
Metric Spaces
Neighborhoods
Properties
Epsilon
Current Page: 2 of 13 | Goto Page:

### How do I find what I need?

You can search for the solutions using keywords and then browse through the results. You can also choose the field and the subject and then browse through those solutions. When you find something that seems interesting, click on it and you’ll get more information about that solution.

### The information that matters

The solutions will include information such as who was the author of the solution, the original question, and sometimes a preview of the solution itself. When you are ready to purchase a solution just click on it and it will be yours.