0
What else can I help you with?
What is the name of a shape with 1 flat face 1 curved face 1 edge and 1 vertex?
cylinder??nope
What shape has one vertex and 1 edge?
A cone has one vertex and one edge.
What is a vertex of a triangle?
It's Edge. That is incorrect. The corners formed by two adjacent lines are the vertex.
It has 1 edge and 1 vertex?
It's a cone
How many faces vertices and edges a cone has?
Faces-2 (1 flat face and 1 curved face), 1 curved edge, and 1 vertex.
What has 1 vertices 1 edge 1 flat face and 1 curved face?
A shape with 1 vertex, 1 edge, 1 flat face, and 1 curved face is a cone. The vertex is the tip of the cone, the edge is the circular base where the flat face meets the curved surface, and the flat face is the circular base itself. The curved face extends from the base to the vertex.
What is a shape with one face no edge no vertex?
How about a sphere as an example that fits the given description
What is the flat part of a 3 dimensional figure?
its called a face an edge is called en edge a point is called a vertex
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 name of a shape with 1 flat face 1 curved face 1 edge and 1 vertex?
cylinder??nope
How many faces and edges and vertices's does cine have?
If you mean a cone then it has a flat base face and a circular face with one edge and one vertex
What shape has one vertex and 1 edge?
A cone has one vertex and one edge.
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); } } }
What shape has 1 vertex 1 face and 1 edge?
cone
What shape has 0 face 0 edge 0 vertex?
Not sure, but my best guess would be a circle. Sorry for the inconvenience.
What has 1 vertex one edge and one curvered face?
Don't know. It cannot be a cone since that has two faces: one curved (curvered?) face and one flat (circular) face. Alternatively, an infinite cone has only one curved face but then it has no edge.
What is it called where two faces of a solid figure meet?
vertex vertex
