Bauinformatik at TU Dresden

Flashcards and summaries for Bauinformatik at the TU Dresden

Arrow Arrow

It’s completely free

studysmarter schule studium
d

4.5 /5

studysmarter schule studium
d

4.8 /5

studysmarter schule studium
d

4.5 /5

studysmarter schule studium
d

4.8 /5

Study with flashcards and summaries for the course Bauinformatik at the TU Dresden

Exemplary flashcards for Bauinformatik at the TU Dresden on StudySmarter:

Was ist ein Graph?

Exemplary flashcards for Bauinformatik at the TU Dresden on StudySmarter:

Was kennzeichnet den Gewichteten Graphen?

Exemplary flashcards for Bauinformatik at the TU Dresden on StudySmarter:

Was ist eine HashMap?

Exemplary flashcards for Bauinformatik at the TU Dresden on StudySmarter:

Was ist die Adjazenzmatrix?

Exemplary flashcards for Bauinformatik at the TU Dresden on StudySmarter:

Was ist ein einfacher Graph?

Exemplary flashcards for Bauinformatik at the TU Dresden on StudySmarter:

Was ist ein Verbundener Graph?

Exemplary flashcards for Bauinformatik at the TU Dresden on StudySmarter:

Was ist ein "Bipartite Graph"?

Exemplary flashcards for Bauinformatik at the TU Dresden on StudySmarter:

Was ist ein "Complete Bipartite Graph"?

Exemplary flashcards for Bauinformatik at the TU Dresden on StudySmarter:

What is Eccentricity?

Exemplary flashcards for Bauinformatik at the TU Dresden on StudySmarter:

What is the Radius of a Graph?

Exemplary flashcards for Bauinformatik at the TU Dresden on StudySmarter:

What is the Diameter of a Graph?

Exemplary flashcards for Bauinformatik at the TU Dresden on StudySmarter:

What is the Circumference of a graph?

Your peers in the course Bauinformatik at the TU Dresden create and share summaries, flashcards, study plans and other learning materials with the intelligent StudySmarter learning app.

Get started now!

Flashcard Flashcard

Exemplary flashcards for Bauinformatik at the TU Dresden on StudySmarter:

Bauinformatik

Was ist ein Graph?

Definition: Knoten, die mittels Kanten verbunden sind, ergeben einen Graph.

Bauinformatik

Was kennzeichnet den Gewichteten Graphen?

Gewichteter Graph: • Aufwandswert, um die Kante zu „benutzen“ (Gewicht bzw. Kosten einer Kante)

Bauinformatik

Was ist eine HashMap?

Zugriff auf ein gespeichertes Objekt (Value) über einen Schlüssel (Key). 

Bauinformatik

Was ist die Adjazenzmatrix?

Adjazenzmatrix 

Speichert, welche Knoten durch eine Kante verbunden sind und wie lang diese Kante ist.

Bauinformatik

Was ist ein einfacher Graph?

SIMPLE GRAPH:

• This is a graph with no loops and no parallel edges.

Bauinformatik

Was ist ein Verbundener Graph?

CONNECTED GRAPH

A graph G is said to be connected if there exists a path between every pair of vertices.

Bauinformatik

Was ist ein "Bipartite Graph"?

Bipartite Graph

A simple graph G = (V, E) with vertex partition V = {V1, V2} is called a bipartite graph if every edge of E joins a vertex in V1 to a vertex in V2.

Bauinformatik

Was ist ein "Complete Bipartite Graph"?

Complete Bipartite Graph

A bipartite graph ‘G’, G = (V, E) with partition V = {V1, V2} is said to be a complete bipartite graph if every vertex in V1 is connected to every vertex of V2.

Bauinformatik

What is Eccentricity?

This is the maximum distance between a vertex to all other vertices.

Bauinformatik

What is the Radius of a Graph?

Radius of a Connected Graph ( r(G) )

The minimum eccentricity from all the vertices is considered as the radius of the Graph G.

Bauinformatik

What is the Diameter of a Graph?

Diameter of a Graph ( d(G) )

From all the eccentricities of the vertices in a graph, the diameter of the connected graph is the maximum of all those eccentricities.

Bauinformatik

What is the Circumference of a graph?

o Circumference of a Graph ( c(G) )

 • This is the number of edges in the longest cycle of ‘G’.

Sign up for free to see all flashcards and summaries for Bauinformatik at the TU Dresden

Singup Image Singup Image
Wave

Other courses from your degree program

For your degree program Bauinformatik at the TU Dresden there are already many courses on StudySmarter, waiting for you to join them. Get access to flashcards, summaries, and much more.

Back to TU Dresden overview page

Mathe BIW

What is StudySmarter?

What is StudySmarter?

StudySmarter is an intelligent learning tool for students. With StudySmarter you can easily and efficiently create flashcards, summaries, mind maps, study plans and more. Create your own flashcards e.g. for Bauinformatik at the TU Dresden or access thousands of learning materials created by your fellow students. Whether at your own university or at other universities. Hundreds of thousands of students use StudySmarter to efficiently prepare for their exams. Available on the Web, Android & iOS. It’s completely free.

Awards

Best EdTech Startup in Europe

Awards
Awards

EUROPEAN YOUTH AWARD IN SMART LEARNING

Awards
Awards

BEST EDTECH STARTUP IN GERMANY

Awards
Awards

Best EdTech Startup in Europe

Awards
Awards

EUROPEAN YOUTH AWARD IN SMART LEARNING

Awards
Awards

BEST EDTECH STARTUP IN GERMANY

Awards