0
Add your answer:
Earn +20 pts
What are the different parts of solid figures?
Surface, edge, and vertex are the different parts of solid figures.
What has one circular face and a curved surface that comes to a point called the vertex?
it is a three dimensional cone , the circle is the edge of the figure and the curved side is the body of the cone, the vertex is the point of the cone
What geometric shape has 1 base 1 edge and no vertex?
circle
What solid figure has 2 faces 1 vertex and 1 edge?
A cone
How many faces edges and vertexs does a cone have?
one face one vertex and two circle edges * * * * * What kind of cone is that? It has 1 edge, 2 faces (one curved and one plane), and 1 vertex.
What are the different parts of solid figures?
Surface, edge, and vertex are the different parts of solid figures.
What is it called where two faces of a solid figure meet?
vertex vertex
What has one circular face and a curved surface that comes to a point called the vertex?
it is a three dimensional cone , the circle is the edge of the figure and the curved side is the body of the cone, the vertex is the point of the cone
What geometric shape has 1 base 1 edge and no vertex?
circle
What solid figure has 2 faces 1 vertex and 1 edge?
A cone
What Has a circular base and a surface formed by connecting the edge of the base to a common vertex?
a cone
What are a face an edge and a vertex?
A face is the flat surface of an object (2 or 3 dimensional). An edge is when two sides (faces) meet on an object. A vertex is the corner of an object, where an angle exists between two or more lines.
What shape has 0 face 0 edge 0 vertex?
Not sure, but my best guess would be a circle. Sorry for the inconvenience.
What shape has one vertex and 1 edge?
A cone has one vertex and one edge.
How many faces edges and vertexs does a cone have?
one face one vertex and two circle edges * * * * * What kind of cone is that? It has 1 edge, 2 faces (one curved and one plane), and 1 vertex.
What is the java program for Dijkstra's algorithm?
import java.util.List; import java.util.ArrayList; import java.util.Collections; class Vertex implements Comparable<Vertex> { public final String name; public Edge[] adjacencies; public double minDistance = Double.POSITIVE_INFINITY; public Vertex previous; public Vertex(String argName) { name = argName; } public String toString() { return name; } public int compareTo(Vertex other) { return Double.compare(minDistance, other.minDistance); } } class Edge { public final Vertex target; public final double weight; public Edge(Vertex argTarget, double argWeight) { target = argTarget; weight = argWeight; } } public class Dijkstra { public static void computePaths(Vertex source) { source.minDistance = 0.; PriorityQueue<Vertex> vertexQueue = new PriorityQueue<Vertex>(); vertexQueue.add(source); while (!vertexQueue.isEmpty()) { Vertex u = vertexQueue.poll(); // Visit each edge exiting u for (Edge e : u.adjacencies) { Vertex v = e.target; double weight = e.weight; double distanceThroughU = u.minDistance + weight; if (distanceThroughU < v.minDistance) { vertexQueue.remove(v); v.minDistance = distanceThroughU ; v.previous = u; vertexQueue.add(v); } } } } public static List<Vertex> getShortestPathTo(Vertex target) { List<Vertex> path = new ArrayList<Vertex>(); for (Vertex vertex = target; vertex != null; vertex = vertex.previous) path.add(vertex); Collections.reverse(path); return path; } public static void main(String[] args) { Vertex v0 = new Vertex("Harrisburg"); Vertex v1 = new Vertex("Baltimore"); Vertex v2 = new Vertex("Washington"); Vertex v3 = new Vertex("Philadelphia"); Vertex v4 = new Vertex("Binghamton"); Vertex v5 = new Vertex("Allentown"); Vertex v6 = new Vertex("New York"); v0.adjacencies = new Edge[]{ new Edge(v1, 79.83), new Edge(v5, 81.15) }; v1.adjacencies = new Edge[]{ new Edge(v0, 79.75), new Edge(v2, 39.42), new Edge(v3, 103.00) }; v2.adjacencies = new Edge[]{ new Edge(v1, 38.65) }; v3.adjacencies = new Edge[]{ new Edge(v1, 102.53), new Edge(v5, 61.44), new Edge(v6, 96.79) }; v4.adjacencies = new Edge[]{ new Edge(v5, 133.04) }; v5.adjacencies = new Edge[]{ new Edge(v0, 81.77), new Edge(v3, 62.05), new Edge(v4, 134.47), new Edge(v6, 91.63) }; v6.adjacencies = new Edge[]{ new Edge(v3, 97.24), new Edge(v5, 87.94) }; Vertex[] vertices = { v0, v1, v2, v3, v4, v5, v6 }; computePaths(v0); for (Vertex v : vertices) { System.out.println("Distance to " + v + ": " + v.minDistance); List<Vertex> path = getShortestPathTo(v); System.out.println("Path: " + path); } } }
How many flat surfaces and edges and vertices has the cone?
a cone has one flat surface one vertex and no edge.
