If you're seeing this message, it means we're having trouble loading external resources on our website.

Pokud používáš webový filtr, ujisti se, že domény: *.kastatic.org and *.kasandbox.org jsou vyloučeny z filtrování.

Hlavní obsah

STANDARDS

 > 

US-IN

Math

Indiana Math

Finite Mathematics: Networks

FM.N.1

Not covered
Use networks, traceable paths, tree diagrams, Venn diagrams, and other pictorial representations to find the number of outcomes in a problem situation.
(Content unavailable)

FM.N.2

Not covered
Optimize networks in different ways and in different contexts by finding minimal spanning trees, shortest paths, and Hamiltonian paths including real-world problems.
(Content unavailable)

FM.N.3

Not covered
Use critical-path analysis in the context of scheduling problems and interpret the results.
(Content unavailable)

FM.N.4

Not covered
Construct and interpret directed and undirected graphs, decision trees, networks, and flow charts that model real-world contexts and problems.
(Content unavailable)

FM.N.5

Not covered
Use graph-coloring techniques to solve problems.
(Content unavailable)

FM.N.6

Not covered
Construct vertex-edge graph models involving relationships among a finite number of elements. Describe a vertex-edge graph using an adjacency matrix. Use vertex-edge graph models to solve problems in a variety of real-world settings.
(Content unavailable)